./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 a31fd051 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-?-a31fd05 [2023-02-15 10:45:08,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:45:08,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:45:08,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:45:08,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:45:08,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:45:08,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:45:08,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:45:08,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:45:08,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:45:08,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:45:08,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:45:08,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:45:08,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:45:08,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:45:08,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:45:08,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:45:08,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:45:08,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:45:08,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:45:08,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:45:08,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:45:08,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:45:08,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:45:08,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:45:08,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:45:08,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:45:08,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:45:08,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:45:08,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:45:08,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:45:08,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:45:08,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:45:08,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:45:08,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:45:08,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:45:08,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:45:08,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:45:08,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:45:08,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:45:08,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:45:08,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:45:08,331 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:45:08,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:45:08,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:45:08,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:45:08,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:45:08,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:45:08,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:45:08,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:45:08,333 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:45:08,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:45:08,334 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:45:08,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:45:08,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:45:08,335 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:45:08,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:45:08,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:45:08,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:45:08,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:45:08,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:45:08,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:45:08,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:45:08,338 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:45:08,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:45:08,338 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:45:08,345 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 10:45:08,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:45:08,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:45:08,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:45:08,518 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:45:08,518 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:45:08,519 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 10:45:09,470 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:45:09,646 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:45:09,647 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-02-15 10:45:09,686 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740c222e0/410a9c8e449e4d31b70563a3a6f495ee/FLAGf31a63bba [2023-02-15 10:45:09,704 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740c222e0/410a9c8e449e4d31b70563a3a6f495ee [2023-02-15 10:45:09,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:45:09,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:45:09,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:45:09,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:45:09,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:45:09,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:09,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1876dbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09, skipping insertion in model container [2023-02-15 10:45:09,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:09,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:45:09,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:45:09,917 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 10:45:09,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:45:09,925 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:45:09,959 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 10:45:09,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:45:09,978 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:45:09,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09 WrapperNode [2023-02-15 10:45:09,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:45:09,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:45:09,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:45:09,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:45:09,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:09,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,009 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-15 10:45:10,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:45:10,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:45:10,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:45:10,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:45:10,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,026 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:45:10,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:45:10,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:45:10,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:45:10,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (1/1) ... [2023-02-15 10:45:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:45:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:10,058 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 10:45:10,072 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 10:45:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:45:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:45:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 10:45:10,092 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 10:45:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:45:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:45:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:45:10,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:45:10,187 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:45:10,188 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:45:10,372 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:45:10,376 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:45:10,376 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:45:10,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:10 BoogieIcfgContainer [2023-02-15 10:45:10,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:45:10,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:45:10,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:45:10,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:45:10,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:45:09" (1/3) ... [2023-02-15 10:45:10,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fddf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:10, skipping insertion in model container [2023-02-15 10:45:10,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:09" (2/3) ... [2023-02-15 10:45:10,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fddf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:10, skipping insertion in model container [2023-02-15 10:45:10,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:10" (3/3) ... [2023-02-15 10:45:10,399 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-02-15 10:45:10,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:45:10,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:45:10,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:45:10,476 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;@1a1814dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:45:10,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:45:10,479 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 10:45:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:45:10,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:10,485 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 10:45:10,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2023-02-15 10:45:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:10,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099854835] [2023-02-15 10:45:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:45:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:10,761 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 10:45:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099854835] [2023-02-15 10:45:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099854835] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:45:10,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:45:10,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:45:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917245929] [2023-02-15 10:45:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:45:10,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:45:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:10,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:45:10,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:45:10,786 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 10:45:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:10,829 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2023-02-15 10:45:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:45:10,831 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 10:45:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:10,835 INFO L225 Difference]: With dead ends: 57 [2023-02-15 10:45:10,835 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 10:45:10,837 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 10:45:10,839 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 10:45:10,840 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 10:45:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 10:45:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-15 10:45:10,861 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 10:45:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-02-15 10:45:10,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2023-02-15 10:45:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:10,864 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-02-15 10:45:10,865 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 10:45:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-02-15 10:45:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:45:10,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:10,867 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 10:45:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:45:10,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2023-02-15 10:45:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097241984] [2023-02-15 10:45:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:45:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:10,991 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 10:45:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097241984] [2023-02-15 10:45:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097241984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:45:10,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:45:10,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:45:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383373807] [2023-02-15 10:45:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:45:10,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:45:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:45:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:45:10,994 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 10:45:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:11,061 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-02-15 10:45:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:45:11,062 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 10:45:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:11,063 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:45:11,064 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 10:45:11,064 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 10:45:11,066 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:11,067 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.1s Time] [2023-02-15 10:45:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 10:45:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 10:45:11,074 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 10:45:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-02-15 10:45:11,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2023-02-15 10:45:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:11,076 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-15 10:45:11,076 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 10:45:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-02-15 10:45:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:45:11,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:11,078 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 10:45:11,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:45:11,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2023-02-15 10:45:11,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:11,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347943322] [2023-02-15 10:45:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 10:45:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,196 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 10:45:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:11,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347943322] [2023-02-15 10:45:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347943322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:45:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:45:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:45:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181486590] [2023-02-15 10:45:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:45:11,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:45:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:45:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:45:11,199 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 10:45:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:11,228 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-02-15 10:45:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:45:11,229 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 10:45:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:11,230 INFO L225 Difference]: With dead ends: 55 [2023-02-15 10:45:11,230 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 10:45:11,230 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 10:45:11,231 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 10:45:11,231 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 10:45:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 10:45:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-02-15 10:45:11,234 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 10:45:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-15 10:45:11,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2023-02-15 10:45:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:11,236 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-15 10:45:11,236 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 10:45:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-15 10:45:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:45:11,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:11,237 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 10:45:11,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:45:11,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2023-02-15 10:45:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358321586] [2023-02-15 10:45:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 10:45:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,373 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 10:45:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358321586] [2023-02-15 10:45:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358321586] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513295485] [2023-02-15 10:45:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:11,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:11,403 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 10:45:11,425 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 10:45:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:11,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:45:11,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:11,620 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 10:45:11,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:11,662 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 10:45:11,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513295485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:45:11,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:45:11,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 10:45:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013305614] [2023-02-15 10:45:11,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:11,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:45:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:45:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:45:11,668 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 10:45:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:11,718 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-15 10:45:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:45:11,719 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 10:45:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:11,721 INFO L225 Difference]: With dead ends: 51 [2023-02-15 10:45:11,721 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:45:11,722 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 10:45:11,724 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 10:45:11,725 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 10:45:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:45:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 10:45:11,728 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 10:45:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-15 10:45:11,729 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2023-02-15 10:45:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:11,730 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-15 10:45:11,730 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 10:45:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-15 10:45:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:45:11,731 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:11,731 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 10:45:11,737 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 10:45:11,937 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 10:45:11,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2023-02-15 10:45:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:11,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599345724] [2023-02-15 10:45:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,314 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 10:45:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599345724] [2023-02-15 10:45:12,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599345724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:45:12,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:45:12,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:45:12,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474036770] [2023-02-15 10:45:12,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:45:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:45:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:45:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:45:12,317 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 10:45:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:12,406 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-02-15 10:45:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:45:12,407 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 10:45:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:12,407 INFO L225 Difference]: With dead ends: 45 [2023-02-15 10:45:12,407 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 10:45:12,408 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 10:45:12,408 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 10:45:12,409 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 10:45:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 10:45:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2023-02-15 10:45:12,412 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 10:45:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-15 10:45:12,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2023-02-15 10:45:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:12,413 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-15 10:45:12,413 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 10:45:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-15 10:45:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:45:12,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:12,414 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 10:45:12,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:45:12,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2023-02-15 10:45:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:12,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493260337] [2023-02-15 10:45:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,762 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 10:45:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493260337] [2023-02-15 10:45:12,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493260337] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476978738] [2023-02-15 10:45:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:12,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:12,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:12,779 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 10:45:12,780 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 10:45:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:12,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 10:45:12,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:13,078 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 10:45:13,125 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 10:45:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:13,142 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 10:45:13,163 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 10:45:13,177 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 10:45:13,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476978738] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:13,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:13,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-02-15 10:45:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722464972] [2023-02-15 10:45:13,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 10:45:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 10:45:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=566, Unknown=5, NotChecked=48, Total=702 [2023-02-15 10:45:13,258 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 10:45:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:13,583 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-02-15 10:45:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:45:13,583 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 10:45:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:13,584 INFO L225 Difference]: With dead ends: 58 [2023-02-15 10:45:13,584 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:45:13,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=892, Unknown=5, NotChecked=62, Total=1122 [2023-02-15 10:45:13,585 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 10:45:13,585 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 10:45:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:45:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 10:45:13,588 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 10:45:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 10:45:13,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 37 [2023-02-15 10:45:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:13,589 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 10:45:13,589 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 10:45:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 10:45:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:45:13,590 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:13,590 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 10:45:13,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:45:13,795 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 10:45:13,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2023-02-15 10:45:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681675328] [2023-02-15 10:45:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:14,294 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 10:45:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681675328] [2023-02-15 10:45:14,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681675328] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:14,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22662506] [2023-02-15 10:45:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:14,309 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 10:45:14,358 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 10:45:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:14,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 10:45:14,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:14,668 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 10:45:14,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:14,737 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 10:45:14,872 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 10:45:14,873 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 10:45:14,891 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 10:45:14,891 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 10:45:14,901 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 10:45:14,930 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 10:45:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:45:14,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:15,099 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_894 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_899))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| |c_#StackHeapBarrier|)) (not (= (select .cse1 .cse2) 0)))))) is different from false [2023-02-15 10:45:15,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22662506] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:15,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2023-02-15 10:45:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965113235] [2023-02-15 10:45:15,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:15,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 10:45:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 10:45:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1078, Unknown=3, NotChecked=66, Total=1260 [2023-02-15 10:45:15,102 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 10:45:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:15,912 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-02-15 10:45:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 10:45:15,912 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2023-02-15 10:45:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:15,913 INFO L225 Difference]: With dead ends: 52 [2023-02-15 10:45:15,913 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 10:45:15,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=364, Invalid=2087, Unknown=3, NotChecked=96, Total=2550 [2023-02-15 10:45:15,914 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 263 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:15,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 140 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:45:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 10:45:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2023-02-15 10:45:15,918 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 10:45:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-15 10:45:15,918 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 40 [2023-02-15 10:45:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:15,918 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-15 10:45:15,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 10:45:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-15 10:45:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:45:15,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:15,919 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 10:45:15,938 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 10:45:16,125 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 10:45:16,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2023-02-15 10:45:16,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:16,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000533660] [2023-02-15 10:45:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:17,425 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 10:45:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000533660] [2023-02-15 10:45:17,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000533660] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311080671] [2023-02-15 10:45:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:17,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:17,427 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 10:45:17,429 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 10:45:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:17,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 10:45:17,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:17,799 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 10:45:17,849 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 10:45:17,948 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:45:17,949 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 10:45:18,109 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 10:45:18,236 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 10:45:18,237 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 10:45:18,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:18,343 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 10:45:18,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:45:18,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-02-15 10:45:18,881 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 10:45:18,885 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 10:45:18,888 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 10:45:19,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,027 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 10:45:19,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-02-15 10:45:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,053 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:45:19,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 10:45:19,059 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 10:45:19,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:19,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 80 [2023-02-15 10:45:19,414 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:45:19,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 116 [2023-02-15 10:45:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-02-15 10:45:19,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2023-02-15 10:45:19,431 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 10:45:19,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 10:45:19,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:19,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:19,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2023-02-15 10:45:19,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:45:19,564 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 10:45:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:45:19,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:20,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311080671] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:20,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:20,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 50 [2023-02-15 10:45:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067950330] [2023-02-15 10:45:20,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 10:45:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 10:45:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2854, Unknown=37, NotChecked=0, Total=3080 [2023-02-15 10:45:20,435 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:23,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:45:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:24,624 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-15 10:45:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:45:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2023-02-15 10:45:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:24,625 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:45:24,625 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 10:45:24,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=550, Invalid=4815, Unknown=37, NotChecked=0, Total=5402 [2023-02-15 10:45:24,627 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 276 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:24,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 236 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 779 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-02-15 10:45:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 10:45:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2023-02-15 10:45:24,633 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 10:45:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-02-15 10:45:24,633 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 40 [2023-02-15 10:45:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:24,633 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-02-15 10:45:24,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-02-15 10:45:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:45:24,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:24,634 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 10:45:24,643 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 10:45:24,841 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 10:45:24,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2023-02-15 10:45:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:24,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723474756] [2023-02-15 10:45:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:45:25,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:25,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723474756] [2023-02-15 10:45:25,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723474756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:25,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343213226] [2023-02-15 10:45:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:25,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:25,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:25,717 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 10:45:25,773 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 10:45:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:25,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-15 10:45:25,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:25,912 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 10:45:25,940 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 10:45:26,016 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:45:26,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 10:45:26,117 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:45:26,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:45:26,206 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-15 10:45:26,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 10:45:26,269 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 10:45:26,328 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:45:26,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 10:45:26,554 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:45:26,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2023-02-15 10:45:26,561 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 10:45:26,566 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:45:26,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 10:45:26,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:26,669 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 10:45:26,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:26,680 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:45:26,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2023-02-15 10:45:26,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:26,698 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-02-15 10:45:26,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 10:45:26,949 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 10:45:26,949 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 10:45:26,981 INFO L321 Elim1Store]: treesize reduction 90, result has 14.3 percent of original size [2023-02-15 10:45:26,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2023-02-15 10:45:27,008 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-15 10:45:27,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 102 [2023-02-15 10:45:27,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:27,018 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 10:45:27,025 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 10:45:27,069 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 10:45:27,126 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:45:27,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2023-02-15 10:45:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:45:27,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:27,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343213226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:27,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:27,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 46 [2023-02-15 10:45:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780612076] [2023-02-15 10:45:27,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:27,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 10:45:27,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 10:45:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2558, Unknown=2, NotChecked=0, Total=2756 [2023-02-15 10:45:27,613 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:29,795 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-15 10:45:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 10:45:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-02-15 10:45:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:29,796 INFO L225 Difference]: With dead ends: 55 [2023-02-15 10:45:29,796 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 10:45:29,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=560, Invalid=4408, Unknown=2, NotChecked=0, Total=4970 [2023-02-15 10:45:29,798 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 193 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:29,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 292 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:45:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 10:45:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2023-02-15 10:45:29,804 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 10:45:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-02-15 10:45:29,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2023-02-15 10:45:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:29,806 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-02-15 10:45:29,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-02-15 10:45:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:45:29,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:29,807 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 10:45:29,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 10:45:30,012 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 10:45:30,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2023-02-15 10:45:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:30,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886601299] [2023-02-15 10:45:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:31,703 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 10:45:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886601299] [2023-02-15 10:45:31,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886601299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492552256] [2023-02-15 10:45:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:31,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:31,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:31,723 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 10:45:31,724 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 10:45:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:32,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 10:45:32,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:32,047 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 10:45:32,112 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 10:45:32,226 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:45:32,226 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 10:45:32,463 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 10:45:32,597 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 10:45:32,597 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 10:45:32,676 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 10:45:32,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:32,688 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 10:45:32,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:45:32,782 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 10:45:32,788 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 10:45:33,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:33,148 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 10:45:33,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 10:45:33,174 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 10:45:33,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:33,348 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 10:45:33,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:33,361 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:45:33,361 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 10:45:33,376 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 10:45:33,377 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 10:45:33,381 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 10:45:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:33,395 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 10:45:33,395 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 10:45:33,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:33,964 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:45:33,987 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-15 10:45:33,987 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 10:45:33,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:34,000 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:45:34,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 135 [2023-02-15 10:45:34,014 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 10:45:34,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 104 [2023-02-15 10:45:34,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:34,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2023-02-15 10:45:34,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2023-02-15 10:45:34,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:34,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:34,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2023-02-15 10:45:34,094 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 10:45:34,139 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 10:45:34,175 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 10:45:34,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:34,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1684 Int) (v_ArrVal_1685 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1680) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1682) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1685)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1684)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 10:45:34,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| Int) (v_ArrVal_1684 Int) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1695 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1685 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1695)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1694))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1696) .cse0 v_ArrVal_1680) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1682) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 v_ArrVal_1685)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1681) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 v_ArrVal_1684)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse2 .cse3) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|) 0))))))) is different from false [2023-02-15 10:45:34,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492552256] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:34,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:34,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2023-02-15 10:45:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481874170] [2023-02-15 10:45:34,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:34,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 10:45:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 10:45:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3211, Unknown=5, NotChecked=230, Total=3660 [2023-02-15 10:45:34,718 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:36,848 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-15 10:45:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 10:45:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-02-15 10:45:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:36,849 INFO L225 Difference]: With dead ends: 55 [2023-02-15 10:45:36,849 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:45:36,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=611, Invalid=5398, Unknown=5, NotChecked=306, Total=6320 [2023-02-15 10:45:36,850 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 233 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:36,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 268 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:45:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:45:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-02-15 10:45:36,874 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 10:45:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-02-15 10:45:36,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 42 [2023-02-15 10:45:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:36,876 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-02-15 10:45:36,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-02-15 10:45:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:45:36,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:36,877 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 10:45:36,899 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 10:45:37,084 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 10:45:37,085 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2023-02-15 10:45:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862890452] [2023-02-15 10:45:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:39,138 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 10:45:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:39,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862890452] [2023-02-15 10:45:39,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862890452] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:39,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394968610] [2023-02-15 10:45:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:39,140 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 10:45:39,142 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 10:45:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:39,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-15 10:45:39,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:39,542 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 10:45:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:39,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-15 10:45:39,787 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 10:45:39,797 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 10:45:39,925 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:45:39,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 10:45:39,930 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 10:45:39,943 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 10:45:39,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-02-15 10:45:40,027 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 10:45:40,031 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 10:45:40,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:45:40,096 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:45:40,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2023-02-15 10:45:40,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:40,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-02-15 10:45:40,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 10:45:40,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:40,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2023-02-15 10:45:40,369 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 10:45:40,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:40,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:45:40,375 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 10:45:40,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:40,511 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:45:40,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 68 [2023-02-15 10:45:40,523 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 10:45:40,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-15 10:45:40,534 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 10:45:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:40,547 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 10:45:40,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2023-02-15 10:45:40,563 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 10:45:40,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 10:45:40,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:45:41,005 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2023-02-15 10:45:41,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 108 [2023-02-15 10:45:41,035 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 10:45:41,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 154 [2023-02-15 10:45:41,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:41,047 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:45:41,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2023-02-15 10:45:41,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:41,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2023-02-15 10:45:41,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-02-15 10:45:41,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:45:41,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:41,306 INFO L321 Elim1Store]: treesize reduction 43, result has 6.5 percent of original size [2023-02-15 10:45:41,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 75 [2023-02-15 10:45:41,314 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 10:45:41,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 10:45:41,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:45:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:45:41,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:41,443 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1961) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1956)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1964))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1963) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-15 10:45:41,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1961) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1956)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1964))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1963) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2023-02-15 10:45:42,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1956)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1964))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1963) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|))))) is different from false [2023-02-15 10:45:43,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394968610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:43,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:43,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2023-02-15 10:45:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406330805] [2023-02-15 10:45:43,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 10:45:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 10:45:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2667, Unknown=39, NotChecked=318, Total=3192 [2023-02-15 10:45:43,367 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:45:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:49,100 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-02-15 10:45:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:45:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-15 10:45:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:49,102 INFO L225 Difference]: With dead ends: 56 [2023-02-15 10:45:49,102 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 10:45:49,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=534, Invalid=4982, Unknown=46, NotChecked=444, Total=6006 [2023-02-15 10:45:49,104 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 247 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:49,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 354 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1118 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 10:45:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 10:45:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2023-02-15 10:45:49,125 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 10:45:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-02-15 10:45:49,126 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2023-02-15 10:45:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:49,126 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-02-15 10:45:49,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-02-15 10:45:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:45:49,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:49,127 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 10:45:49,138 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 10:45:49,338 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 10:45:49,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2023-02-15 10:45:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:49,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474793081] [2023-02-15 10:45:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:45:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:50,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474793081] [2023-02-15 10:45:50,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474793081] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:50,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380973959] [2023-02-15 10:45:50,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:45:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:50,831 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 10:45:50,833 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 10:45:51,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:45:51,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:45:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-15 10:45:51,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:51,094 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 10:45:51,163 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 10:45:51,167 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 10:45:51,365 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:45:51,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 10:45:51,380 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:45:51,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 10:45:51,395 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 10:45:51,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-02-15 10:45:51,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-15 10:45:51,474 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 10:45:51,481 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 10:45:51,485 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 10:45:51,549 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-02-15 10:45:51,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 57 [2023-02-15 10:45:51,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 10:45:51,797 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-02-15 10:45:51,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2023-02-15 10:45:51,808 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 10:45:51,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 10:45:51,812 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 10:45:51,852 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2231 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2231))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2230 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2230) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 10:45:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:51,880 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 10:45:51,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 106 [2023-02-15 10:45:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:51,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:51,894 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-15 10:45:51,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2023-02-15 10:45:51,912 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 10:45:51,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 10:45:52,111 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2023-02-15 10:45:52,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2023-02-15 10:45:52,124 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-15 10:45:52,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2023-02-15 10:45:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-15 10:45:52,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:45:52,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380973959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:52,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:45:52,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2023-02-15 10:45:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895858240] [2023-02-15 10:45:52,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:45:52,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 10:45:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:45:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 10:45:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1859, Unknown=2, NotChecked=86, Total=2070 [2023-02-15 10:45:52,447 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:45:54,854 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2023-02-15 10:45:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:45:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-15 10:45:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:45:54,857 INFO L225 Difference]: With dead ends: 74 [2023-02-15 10:45:54,857 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 10:45:54,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=288, Invalid=3136, Unknown=2, NotChecked=114, Total=3540 [2023-02-15 10:45:54,858 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:45:54,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 338 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 806 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2023-02-15 10:45:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 10:45:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-02-15 10:45:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 10:45:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-02-15 10:45:54,889 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2023-02-15 10:45:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:45:54,890 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-02-15 10:45:54,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:45:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-02-15 10:45:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 10:45:54,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:45:54,890 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 10:45:54,904 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 10:45:55,096 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 10:45:55,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:45:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:45:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2023-02-15 10:45:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:45:55,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717808843] [2023-02-15 10:45:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:55,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:45:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:45:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:45:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:56,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:45:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:56,850 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 10:45:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:45:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717808843] [2023-02-15 10:45:56,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717808843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:45:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669533395] [2023-02-15 10:45:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:45:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:45:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:45:56,851 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 10:45:56,853 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 10:45:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:45:57,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 144 conjunts are in the unsatisfiable core [2023-02-15 10:45:57,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:45:57,464 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 10:45:57,502 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 10:45:57,601 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from false [2023-02-15 10:45:57,603 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from true [2023-02-15 10:45:57,617 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0))))))) is different from false [2023-02-15 10:45:57,618 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0))))))) is different from true [2023-02-15 10:45:57,668 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-02-15 10:45:57,670 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-02-15 10:45:57,699 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:57,700 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:57,718 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:57,720 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:57,768 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:57,770 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:57,832 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:57,834 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:57,842 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 10:45:57,867 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 10:45:57,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2023-02-15 10:45:57,884 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2023-02-15 10:45:57,901 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:45:57,901 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 10:45:57,920 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:45:57,920 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 10:45:57,927 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 10:45:57,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2023-02-15 10:45:57,949 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2023-02-15 10:45:58,009 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:45:58,012 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:45:58,083 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:45:58,085 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:45:58,161 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2023-02-15 10:45:58,163 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2023-02-15 10:45:58,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:45:58,174 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 10:45:58,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:58,178 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 10:45:58,214 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:58,216 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:58,252 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:58,255 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:58,345 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:45:58,348 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:45:58,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:58,396 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:45:58,396 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 10:45:58,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:58,409 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 10:45:58,409 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 10:45:58,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= .cse3 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_30| .cse6)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse2))))) is different from false [2023-02-15 10:45:58,512 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= .cse3 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_30| .cse6)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse2))))) is different from true [2023-02-15 10:45:58,619 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse3))))) is different from false [2023-02-15 10:45:58,622 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse3))))) is different from true [2023-02-15 10:45:58,719 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_29| .cse6))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4))))) is different from false [2023-02-15 10:45:58,723 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_29| .cse6))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4))))) is different from true [2023-02-15 10:45:58,950 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2023-02-15 10:45:58,954 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2023-02-15 10:45:59,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2023-02-15 10:45:59,066 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2023-02-15 10:45:59,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2023-02-15 10:45:59,175 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2023-02-15 10:45:59,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:45:59,243 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2023-02-15 10:45:59,244 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 10:45:59,295 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 10:45:59,295 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 10:45:59,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:59,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:59,320 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:45:59,320 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 10:45:59,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:45:59,356 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 10:45:59,356 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 10:45:59,448 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) (+ 4 (select .cse4 (+ .cse2 4)))))) (let ((.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select .cse4 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5))))))) is different from false [2023-02-15 10:45:59,452 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) (+ 4 (select .cse4 (+ .cse2 4)))))) (let ((.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select .cse4 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5))))))) is different from true [2023-02-15 10:45:59,824 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-15 10:46:00,248 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-15 10:46:00,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:00,388 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 10:46:00,388 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 10:46:00,501 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from false [2023-02-15 10:46:00,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from true [2023-02-15 10:46:00,613 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:46:00,617 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:46:00,617 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 10:46:00,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_58 Int) (v_arrayElimIndex_57 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_58) 0) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_58) 1) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57) 0) (= (select (store |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_33| .cse2))) |v_#valid_BEFORE_CALL_33|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_57 0)))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:46:00,697 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_58 Int) (v_arrayElimIndex_57 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_58) 0) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_58) 1) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57) 0) (= (select (store |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_33| .cse2))) |v_#valid_BEFORE_CALL_33|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_57 0)))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:46:00,698 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 10:46:00,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:46:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669533395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:46:01,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:46:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 54 [2023-02-15 10:46:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121398993] [2023-02-15 10:46:01,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:46:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 10:46:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:46:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 10:46:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1389, Unknown=52, NotChecked=2450, Total=4032 [2023-02-15 10:46:01,551 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:46:01,834 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-02-15 10:46:01,836 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-02-15 10:46:01,838 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-02-15 10:46:01,839 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-02-15 10:46:01,842 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-02-15 10:46:01,843 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-02-15 10:46:01,846 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:46:01,848 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:46:01,850 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:46:01,852 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:46:01,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:46:01,864 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:46:01,873 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:46:01,875 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:46:01,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2023-02-15 10:46:01,887 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2023-02-15 10:46:01,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= .cse1 0) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from false [2023-02-15 10:46:01,899 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= .cse1 0) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from true [2023-02-15 10:46:01,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not .cse2) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2023-02-15 10:46:01,908 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not .cse2) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2023-02-15 10:46:01,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse2 (and (<= .cse3 0) (<= 0 .cse3))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= .cse3 0)))) is different from false [2023-02-15 10:46:01,918 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse2 (and (<= .cse3 0) (<= 0 .cse3))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= .cse3 0)))) is different from true [2023-02-15 10:46:01,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse4) (= .cse3 0) (not .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from false [2023-02-15 10:46:01,930 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse4) (= .cse3 0) (not .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from true [2023-02-15 10:46:01,938 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2023-02-15 10:46:01,941 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2023-02-15 10:46:01,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:46:01,954 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:46:01,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2023-02-15 10:46:01,994 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2023-02-15 10:46:02,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse7 .cse2)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_30| .cse8)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse3))))) is different from false [2023-02-15 10:46:02,024 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse7 .cse2)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_30| .cse8)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse3))))) is different from true [2023-02-15 10:46:02,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 .cse0)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse5))))) is different from false [2023-02-15 10:46:02,074 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 .cse0)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse5))))) is different from true [2023-02-15 10:46:02,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5))))) is different from false [2023-02-15 10:46:02,124 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5))))) is different from true [2023-02-15 10:46:02,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2023-02-15 10:46:02,166 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2023-02-15 10:46:02,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2023-02-15 10:46:02,240 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2023-02-15 10:46:02,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2023-02-15 10:46:02,300 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2023-02-15 10:46:02,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 (+ 4 (select .cse10 (+ .cse2 4)))))) (let ((.cse3 (select .cse10 4)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 0) (not (= (select .cse4 4) 0)) (or (and (<= 0 .cse3) (<= .cse3 0)) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5)))))))) is different from false [2023-02-15 10:46:02,356 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 (+ 4 (select .cse10 (+ .cse2 4)))))) (let ((.cse3 (select .cse10 4)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 0) (not (= (select .cse4 4) 0)) (or (and (<= 0 .cse3) (<= .cse3 0)) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5)))))))) is different from true [2023-02-15 10:46:02,397 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10)) 4) 0)))) is different from false [2023-02-15 10:46:02,401 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10)) 4) 0)))) is different from true [2023-02-15 10:46:02,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7) 0)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2023-02-15 10:46:02,433 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7) 0)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2023-02-15 10:46:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:46:02,575 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-02-15 10:46:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 10:46:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 10:46:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:46:02,576 INFO L225 Difference]: With dead ends: 79 [2023-02-15 10:46:02,576 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 10:46:02,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 49 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=201, Invalid=1535, Unknown=100, NotChecked=6174, Total=8010 [2023-02-15 10:46:02,578 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:46:02,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 326 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 276 Invalid, 0 Unknown, 710 Unchecked, 0.2s Time] [2023-02-15 10:46:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 10:46:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-02-15 10:46:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 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 10:46:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 10:46:02,597 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 46 [2023-02-15 10:46:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:46:02,598 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 10:46:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:46:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 10:46:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 10:46:02,598 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:46:02,599 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 10:46:02,607 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 10:46:02,805 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 10:46:02,806 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:46:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:46:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2023-02-15 10:46:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:46:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874233852] [2023-02-15 10:46:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:46:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:46:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:46:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:46:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:46:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:46:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:46:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 10:46:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:46:04,521 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 10:46:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:46:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874233852] [2023-02-15 10:46:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874233852] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:46:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945394762] [2023-02-15 10:46:04,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:46:04,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:46:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:46:04,524 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 10:46:04,525 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 10:46:04,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:46:04,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:46:04,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 161 conjunts are in the unsatisfiable core [2023-02-15 10:46:04,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:46:04,785 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 10:46:04,827 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 10:46:04,940 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from false [2023-02-15 10:46:04,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from true [2023-02-15 10:46:04,957 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) is different from false [2023-02-15 10:46:04,959 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) is different from true [2023-02-15 10:46:04,987 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-02-15 10:46:04,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-02-15 10:46:05,015 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2023-02-15 10:46:05,016 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2023-02-15 10:46:05,032 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-15 10:46:05,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-15 10:46:05,074 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2023-02-15 10:46:05,075 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2023-02-15 10:46:05,124 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= |v_#valid_BEFORE_CALL_37| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_37| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2023-02-15 10:46:05,126 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= |v_#valid_BEFORE_CALL_37| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_37| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2023-02-15 10:46:05,134 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 10:46:05,151 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 10:46:05,173 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from false [2023-02-15 10:46:05,175 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from true [2023-02-15 10:46:05,191 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:46:05,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-02-15 10:46:05,234 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:46:05,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2023-02-15 10:46:05,241 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 10:46:05,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from false [2023-02-15 10:46:05,292 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from true [2023-02-15 10:46:05,332 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from false [2023-02-15 10:46:05,334 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from true [2023-02-15 10:46:05,409 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2023-02-15 10:46:05,411 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from true [2023-02-15 10:46:05,461 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_37| .cse4)))) (= (select |v_#valid_BEFORE_CALL_37| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1)))))) is different from false [2023-02-15 10:46:05,463 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_37| .cse4)))) (= (select |v_#valid_BEFORE_CALL_37| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1)))))) is different from true [2023-02-15 10:46:05,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:46:05,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2023-02-15 10:46:05,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:05,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 10:46:05,510 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from false [2023-02-15 10:46:05,513 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from true [2023-02-15 10:46:05,554 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from false [2023-02-15 10:46:05,556 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from true [2023-02-15 10:46:05,595 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 10:46:05,631 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_2747 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2747))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230)))) (exists ((v_ArrVal_2746 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2746)))) is different from false [2023-02-15 10:46:05,634 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_2747 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2747))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230)))) (exists ((v_ArrVal_2746 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2746)))) is different from true [2023-02-15 10:46:05,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:05,710 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:46:05,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 79 [2023-02-15 10:46:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:05,736 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 10:46:05,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2023-02-15 10:46:05,802 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0)))))) is different from false [2023-02-15 10:46:05,805 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0)))))) is different from true [2023-02-15 10:46:05,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_37| .cse5)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse3 .cse4))))) is different from false [2023-02-15 10:46:05,911 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_37| .cse5)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse3 .cse4))))) is different from true [2023-02-15 10:46:06,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_36| .cse2))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_37| .cse6)))) (= (select |v_#valid_BEFORE_CALL_37| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse4 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))) is different from false [2023-02-15 10:46:06,015 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_36| .cse2))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_37| .cse6)))) (= (select |v_#valid_BEFORE_CALL_37| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse4 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))) is different from true [2023-02-15 10:46:06,186 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select .cse2 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse5 (select |v_#valid_BEFORE_CALL_40| .cse5)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_37| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse6) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse9 (select .cse10 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse3)))))) is different from false [2023-02-15 10:46:06,190 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select .cse2 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse5 (select |v_#valid_BEFORE_CALL_40| .cse5)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_37| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse6) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse9 (select .cse10 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse3)))))) is different from true [2023-02-15 10:46:06,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:46:06,413 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 10:46:06,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 146 [2023-02-15 10:46:06,483 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 10:46:06,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 583 treesize of output 380 [2023-02-15 10:46:06,545 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-15 10:46:06,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 541 treesize of output 338 [2023-02-15 10:46:06,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 49 [2023-02-15 10:46:06,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:06,611 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2023-02-15 10:46:06,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 231 [2023-02-15 10:46:06,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2023-02-15 10:46:06,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (+ .cse8 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (let ((.cse1 (+ 2 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_37| .cse3)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) .cse5) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_36| .cse7))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (and (<= 0 .cse8) (<= .cse8 0)) (= .cse2 .cse4) (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)))))))) is different from false [2023-02-15 10:46:06,699 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (+ .cse8 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (let ((.cse1 (+ 2 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_37| .cse3)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) .cse5) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_36| .cse7))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (and (<= 0 .cse8) (<= .cse8 0)) (= .cse2 .cse4) (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)))))))) is different from true [2023-02-15 10:46:07,051 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse2) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse1 0) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_37| .cse7)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse0 1) .cse8) 0) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))))))) is different from false [2023-02-15 10:46:07,054 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse2) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse1 0) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_37| .cse7)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse0 1) .cse8) 0) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))))))) is different from true [2023-02-15 10:46:07,391 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse3 (select .cse1 4)) (.cse11 (+ .cse0 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse3) .cse11))) (let ((.cse4 (+ 2 .cse9)) (.cse2 (+ .cse7 4))) (and (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse0 0) (= .cse7 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse10 1) .cse9) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse11) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-02-15 10:46:07,396 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse3 (select .cse1 4)) (.cse11 (+ .cse0 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse3) .cse11))) (let ((.cse4 (+ 2 .cse9)) (.cse2 (+ .cse7 4))) (and (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse0 0) (= .cse7 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse10 1) .cse9) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse11) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-02-15 10:46:07,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:46:07,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:07,555 INFO L321 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2023-02-15 10:46:07,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 301 treesize of output 134 [2023-02-15 10:46:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:07,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:46:07,584 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-15 10:46:07,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2023-02-15 10:46:07,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((v_arrayElimIndex_75 Int) (v_arrayElimIndex_72 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_75) 0) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_75) 1) (= (select (store |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_37| .cse2)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from false [2023-02-15 10:46:07,650 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((v_arrayElimIndex_75 Int) (v_arrayElimIndex_72 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_75) 0) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_75) 1) (= (select (store |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_37| .cse2)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from true [2023-02-15 10:46:07,667 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 10:46:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2023-02-15 10:46:07,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:46:07,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2023-02-15 10:46:07,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2023-02-15 10:46:07,888 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2023-02-15 10:46:07,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (+ 8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2023-02-15 10:46:07,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:46:07,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1383 treesize of output 1376 [2023-02-15 10:46:07,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:46:07,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31892 treesize of output 29932 [2023-02-15 10:46:07,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34508 treesize of output 29292 [2023-02-15 10:48:35,982 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 10564 treesize of output 7304