./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:51:22,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:51:22,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:51:22,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:51:22,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:51:22,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:51:22,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:51:22,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:51:22,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:51:22,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:51:22,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:51:22,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:51:22,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:51:22,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:51:22,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:51:22,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:51:22,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:51:22,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:51:22,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:51:22,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:51:22,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:51:22,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:51:22,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:51:22,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:51:22,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:51:22,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:51:22,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:51:22,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:51:22,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:51:22,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:51:22,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:51:22,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:51:22,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:51:22,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:51:22,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:51:22,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:51:22,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:51:22,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:51:22,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:51:22,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:51:22,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:51:22,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:51:22,551 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:51:22,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:51:22,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:51:22,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:51:22,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:51:22,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:51:22,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:51:22,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:51:22,554 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:51:22,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:51:22,554 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:51:22,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:51:22,556 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:51:22,556 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:51:22,556 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:51:22,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:51:22,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:51:22,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:51:22,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:51:22,558 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:51:22,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:51:22,558 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:51:22,558 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-02-14 13:51:22,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:51:22,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:51:22,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:51:22,791 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:51:22,793 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:51:22,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-14 13:51:23,744 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:51:23,969 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:51:23,969 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-14 13:51:23,982 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c2f9b10/3701b56181a84879b170c8c4e22a0832/FLAG78248d2e4 [2023-02-14 13:51:23,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c2f9b10/3701b56181a84879b170c8c4e22a0832 [2023-02-14 13:51:23,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:51:23,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:51:23,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:51:23,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:51:24,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:51:24,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:51:23" (1/1) ... [2023-02-14 13:51:24,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac90d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24, skipping insertion in model container [2023-02-14 13:51:24,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:51:23" (1/1) ... [2023-02-14 13:51:24,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:51:24,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:51:24,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-02-14 13:51:24,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:51:24,274 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:51:24,309 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-02-14 13:51:24,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:51:24,330 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:51:24,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24 WrapperNode [2023-02-14 13:51:24,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:51:24,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:51:24,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:51:24,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:51:24,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,375 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-14 13:51:24,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:51:24,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:51:24,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:51:24,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:51:24,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,400 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:51:24,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:51:24,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:51:24,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:51:24,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (1/1) ... [2023-02-14 13:51:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:51:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:24,428 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-14 13:51:24,436 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-14 13:51:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:51:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:51:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:51:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:51:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:51:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:51:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:51:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:51:24,590 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:51:24,592 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:51:24,955 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:51:24,965 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:51:24,972 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 13:51:24,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:51:24 BoogieIcfgContainer [2023-02-14 13:51:24,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:51:24,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:51:24,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:51:24,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:51:24,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:51:23" (1/3) ... [2023-02-14 13:51:24,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5794a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:51:24, skipping insertion in model container [2023-02-14 13:51:24,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:51:24" (2/3) ... [2023-02-14 13:51:24,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5794a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:51:24, skipping insertion in model container [2023-02-14 13:51:24,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:51:24" (3/3) ... [2023-02-14 13:51:24,982 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-02-14 13:51:24,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:51:24,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-14 13:51:25,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:51:25,042 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ffebcf3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:51:25,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-14 13:51:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:51:25,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:25,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:51:25,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2023-02-14 13:51:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:25,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104673372] [2023-02-14 13:51:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,243 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-14 13:51:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:25,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104673372] [2023-02-14 13:51:25,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104673372] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:25,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:25,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:51:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202190381] [2023-02-14 13:51:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:25,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:51:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:51:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:51:25,281 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:51:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:25,420 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2023-02-14 13:51:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:51:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:51:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:25,427 INFO L225 Difference]: With dead ends: 128 [2023-02-14 13:51:25,427 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 13:51:25,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:51:25,430 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:25,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 195 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 13:51:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-14 13:51:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2023-02-14 13:51:25,458 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2023-02-14 13:51:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:25,458 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2023-02-14 13:51:25,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:51:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2023-02-14 13:51:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:51:25,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:25,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:51:25,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:51:25,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2023-02-14 13:51:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985373613] [2023-02-14 13:51:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,552 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-14 13:51:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985373613] [2023-02-14 13:51:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985373613] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:25,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:25,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:51:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144889236] [2023-02-14 13:51:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:25,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:51:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:51:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:51:25,557 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:51:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:25,630 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-02-14 13:51:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:51:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:51:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:25,632 INFO L225 Difference]: With dead ends: 122 [2023-02-14 13:51:25,632 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 13:51:25,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:51:25,633 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:25,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 13:51:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-14 13:51:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-14 13:51:25,650 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2023-02-14 13:51:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:25,650 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-14 13:51:25,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:51:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-14 13:51:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:51:25,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:25,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:25,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:51:25,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2023-02-14 13:51:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:25,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987572125] [2023-02-14 13:51:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,738 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-14 13:51:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:25,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987572125] [2023-02-14 13:51:25,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987572125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:25,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:51:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196043480] [2023-02-14 13:51:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:25,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:51:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:51:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:51:25,750 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:51:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:25,859 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2023-02-14 13:51:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:51:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-14 13:51:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:25,861 INFO L225 Difference]: With dead ends: 133 [2023-02-14 13:51:25,862 INFO L226 Difference]: Without dead ends: 133 [2023-02-14 13:51:25,862 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-14 13:51:25,863 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:25,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-14 13:51:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2023-02-14 13:51:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2023-02-14 13:51:25,875 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2023-02-14 13:51:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:25,876 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2023-02-14 13:51:25,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:51:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2023-02-14 13:51:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 13:51:25,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:25,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:51:25,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2023-02-14 13:51:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562367] [2023-02-14 13:51:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562367] [2023-02-14 13:51:26,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562367] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:26,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:26,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:51:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673932426] [2023-02-14 13:51:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:26,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:51:26,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:26,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:51:26,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:51:26,043 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:26,232 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-14 13:51:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-14 13:51:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:26,236 INFO L225 Difference]: With dead ends: 123 [2023-02-14 13:51:26,236 INFO L226 Difference]: Without dead ends: 123 [2023-02-14 13:51:26,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:26,243 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:26,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-14 13:51:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-02-14 13:51:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-14 13:51:26,254 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2023-02-14 13:51:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:26,255 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-14 13:51:26,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-14 13:51:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 13:51:26,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:26,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:26,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:51:26,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2023-02-14 13:51:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797555625] [2023-02-14 13:51:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:26,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797555625] [2023-02-14 13:51:26,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797555625] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:26,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:26,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:51:26,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57204713] [2023-02-14 13:51:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:26,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:51:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:26,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:51:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:51:26,537 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:26,732 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-14 13:51:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-14 13:51:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:26,734 INFO L225 Difference]: With dead ends: 122 [2023-02-14 13:51:26,734 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 13:51:26,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:26,734 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 13:51:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-14 13:51:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-14 13:51:26,738 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-14 13:51:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:26,739 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-14 13:51:26,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-14 13:51:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 13:51:26,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:26,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:26,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:51:26,740 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2023-02-14 13:51:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:26,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566512695] [2023-02-14 13:51:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:26,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566512695] [2023-02-14 13:51:26,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566512695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:26,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68684911] [2023-02-14 13:51:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:26,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:26,982 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-14 13:51:26,984 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-14 13:51:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:27,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 13:51:27,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:27,119 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-14 13:51:27,180 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:51:27,275 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:51:27,276 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-14 13:51:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-14 13:51:27,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:27,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68684911] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:27,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:27,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-14 13:51:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863261605] [2023-02-14 13:51:27,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:27,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:51:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:51:27,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-14 13:51:27,344 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:27,603 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2023-02-14 13:51:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-14 13:51:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:27,604 INFO L225 Difference]: With dead ends: 146 [2023-02-14 13:51:27,604 INFO L226 Difference]: Without dead ends: 146 [2023-02-14 13:51:27,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-14 13:51:27,606 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 99 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:27,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 379 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 423 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2023-02-14 13:51:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-14 13:51:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-02-14 13:51:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2023-02-14 13:51:27,632 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2023-02-14 13:51:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:27,632 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2023-02-14 13:51:27,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2023-02-14 13:51:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 13:51:27,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:27,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:27,638 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-14 13:51:27,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-14 13:51:27,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2023-02-14 13:51:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:27,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14013675] [2023-02-14 13:51:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14013675] [2023-02-14 13:51:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14013675] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510727269] [2023-02-14 13:51:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:28,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:28,104 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-14 13:51:28,106 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-14 13:51:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:28,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 13:51:28,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:28,203 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-14 13:51:28,324 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:51:28,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:28,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:51:28,372 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:51:28,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:51:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-14 13:51:28,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:32,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510727269] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:32,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:32,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-02-14 13:51:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527858553] [2023-02-14 13:51:32,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:32,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 13:51:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 13:51:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2023-02-14 13:51:32,537 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:51:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:33,020 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-14 13:51:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:51:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-14 13:51:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:33,021 INFO L225 Difference]: With dead ends: 128 [2023-02-14 13:51:33,021 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 13:51:33,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2023-02-14 13:51:33,022 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 14 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:33,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 739 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 778 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2023-02-14 13:51:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 13:51:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-02-14 13:51:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-14 13:51:33,025 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2023-02-14 13:51:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:33,025 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-14 13:51:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:51:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-14 13:51:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 13:51:33,025 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:33,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:33,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:51:33,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-14 13:51:33,229 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2023-02-14 13:51:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:33,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965461265] [2023-02-14 13:51:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:33,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965461265] [2023-02-14 13:51:33,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965461265] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887603570] [2023-02-14 13:51:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:33,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:33,348 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-14 13:51:33,350 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-14 13:51:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:51:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:33,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887603570] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:51:33,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:51:33,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-14 13:51:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098852201] [2023-02-14 13:51:33,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:33,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:51:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:51:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:51:33,548 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:51:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:33,701 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-14 13:51:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-14 13:51:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:33,702 INFO L225 Difference]: With dead ends: 127 [2023-02-14 13:51:33,702 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 13:51:33,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:33,703 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:33,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 618 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 13:51:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2023-02-14 13:51:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2023-02-14 13:51:33,706 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2023-02-14 13:51:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:33,706 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2023-02-14 13:51:33,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 13:51:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2023-02-14 13:51:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 13:51:33,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:33,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:33,724 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-14 13:51:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:33,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2023-02-14 13:51:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457728196] [2023-02-14 13:51:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:51:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457728196] [2023-02-14 13:51:33,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457728196] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763309908] [2023-02-14 13:51:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:33,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:33,989 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-14 13:51:33,992 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-14 13:51:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:34,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 13:51:34,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:51:34,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:34,132 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:51:34,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-02-14 13:51:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:51:34,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763309908] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:51:34,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:51:34,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-14 13:51:34,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88086503] [2023-02-14 13:51:34,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:34,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:51:34,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:51:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:51:34,148 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:34,291 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-14 13:51:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-14 13:51:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:34,292 INFO L225 Difference]: With dead ends: 131 [2023-02-14 13:51:34,292 INFO L226 Difference]: Without dead ends: 131 [2023-02-14 13:51:34,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:34,293 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:34,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 403 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-14 13:51:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-14 13:51:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 123 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-14 13:51:34,296 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2023-02-14 13:51:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:34,296 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-14 13:51:34,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-14 13:51:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 13:51:34,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:34,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:34,304 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-14 13:51:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:34,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2023-02-14 13:51:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:34,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180383062] [2023-02-14 13:51:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180383062] [2023-02-14 13:51:34,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180383062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604064533] [2023-02-14 13:51:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:34,638 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-14 13:51:34,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:51:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:34,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 13:51:34,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:34,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:34,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:34,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-14 13:51:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:34,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604064533] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:51:34,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:51:34,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-02-14 13:51:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537301921] [2023-02-14 13:51:34,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 13:51:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 13:51:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:51:34,989 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 13:51:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:35,220 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2023-02-14 13:51:35,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 13:51:35,221 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-14 13:51:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:35,221 INFO L225 Difference]: With dead ends: 136 [2023-02-14 13:51:35,221 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 13:51:35,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:51:35,222 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 22 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:35,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1057 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 13:51:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2023-02-14 13:51:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 123 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2023-02-14 13:51:35,225 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2023-02-14 13:51:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:35,225 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2023-02-14 13:51:35,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 13:51:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2023-02-14 13:51:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 13:51:35,226 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:35,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:35,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 13:51:35,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-14 13:51:35,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2023-02-14 13:51:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:35,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949203992] [2023-02-14 13:51:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:35,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949203992] [2023-02-14 13:51:35,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949203992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:35,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:35,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:51:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007957457] [2023-02-14 13:51:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:35,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:51:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:51:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:35,530 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:35,737 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-14 13:51:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:51:35,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-14 13:51:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:35,738 INFO L225 Difference]: With dead ends: 129 [2023-02-14 13:51:35,738 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 13:51:35,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:51:35,739 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:35,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 445 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 13:51:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-14 13:51:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-14 13:51:35,741 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2023-02-14 13:51:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:35,741 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-14 13:51:35,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-14 13:51:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 13:51:35,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:35,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:51:35,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2023-02-14 13:51:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:35,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106828019] [2023-02-14 13:51:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:51:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:35,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106828019] [2023-02-14 13:51:35,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106828019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:35,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:35,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:51:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290510569] [2023-02-14 13:51:35,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:35,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:51:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:51:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:35,903 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:36,118 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-14 13:51:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:51:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-14 13:51:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:36,119 INFO L225 Difference]: With dead ends: 127 [2023-02-14 13:51:36,119 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 13:51:36,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:51:36,119 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:36,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 13:51:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-14 13:51:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 13:51:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-14 13:51:36,122 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-14 13:51:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:36,122 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-14 13:51:36,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:51:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-14 13:51:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:51:36,122 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:36,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:36,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:51:36,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2023-02-14 13:51:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:36,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270131464] [2023-02-14 13:51:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-14 13:51:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-14 13:51:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:36,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270131464] [2023-02-14 13:51:36,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270131464] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406127840] [2023-02-14 13:51:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:36,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:36,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:36,205 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-14 13:51:36,207 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-14 13:51:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:51:36,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:51:36,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:51:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406127840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:51:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-14 13:51:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413611458] [2023-02-14 13:51:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:51:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:51:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:51:36,383 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:36,392 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-02-14 13:51:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:51:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-14 13:51:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:36,394 INFO L225 Difference]: With dead ends: 115 [2023-02-14 13:51:36,394 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 13:51:36,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:51:36,396 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 198 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:36,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 134 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:51:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 13:51:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-14 13:51:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-02-14 13:51:36,400 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2023-02-14 13:51:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:36,401 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-02-14 13:51:36,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-02-14 13:51:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:51:36,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:36,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:36,417 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-14 13:51:36,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:36,606 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2023-02-14 13:51:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:36,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485776682] [2023-02-14 13:51:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:51:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:36,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485776682] [2023-02-14 13:51:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485776682] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91517659] [2023-02-14 13:51:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:37,005 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-14 13:51:37,007 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-14 13:51:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:37,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 13:51:37,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:37,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:51:37,200 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-14 13:51:37,215 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2023-02-14 13:51:37,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:37,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:37,262 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:51:37,278 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:51:37,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:37,310 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:51:37,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-02-14 13:51:37,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:37,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91517659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:37,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:37,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2023-02-14 13:51:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164754512] [2023-02-14 13:51:37,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 13:51:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 13:51:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2023-02-14 13:51:37,506 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:51:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:37,732 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-02-14 13:51:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:51:37,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-14 13:51:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:37,733 INFO L225 Difference]: With dead ends: 125 [2023-02-14 13:51:37,733 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 13:51:37,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2023-02-14 13:51:37,734 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 260 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:37,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 266 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 250 Unchecked, 0.2s Time] [2023-02-14 13:51:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 13:51:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-14 13:51:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.646153846153846) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-02-14 13:51:37,736 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2023-02-14 13:51:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:37,736 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-02-14 13:51:37,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:51:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-02-14 13:51:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:51:37,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:37,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:37,744 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-14 13:51:37,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:37,942 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2023-02-14 13:51:37,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:37,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860695799] [2023-02-14 13:51:37,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:37,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:51:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860695799] [2023-02-14 13:51:38,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860695799] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550971868] [2023-02-14 13:51:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:38,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:38,403 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-14 13:51:38,405 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-14 13:51:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:38,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:51:38,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:38,580 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-14 13:51:38,589 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-14 13:51:38,601 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:51:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:38,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:38,646 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-14 13:51:38,653 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:51:38,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:38,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:38,734 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-14 13:51:38,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1825 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1825) |c_#length|)))) is different from true [2023-02-14 13:51:38,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:38,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:51:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-14 13:51:38,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:38,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550971868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:38,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:38,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-14 13:51:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223800813] [2023-02-14 13:51:38,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:38,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 13:51:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 13:51:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2023-02-14 13:51:38,854 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:51:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:39,075 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-14 13:51:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:51:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-14 13:51:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:39,077 INFO L225 Difference]: With dead ends: 117 [2023-02-14 13:51:39,077 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 13:51:39,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2023-02-14 13:51:39,077 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 203 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:39,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 104 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 351 Unchecked, 0.2s Time] [2023-02-14 13:51:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 13:51:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-02-14 13:51:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.523076923076923) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-02-14 13:51:39,080 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2023-02-14 13:51:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-02-14 13:51:39,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:51:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-02-14 13:51:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:51:39,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:39,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:39,112 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-14 13:51:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 13:51:39,288 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2023-02-14 13:51:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543484797] [2023-02-14 13:51:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 13:51:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:39,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543484797] [2023-02-14 13:51:39,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543484797] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:39,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:39,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:51:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371506014] [2023-02-14 13:51:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:51:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:51:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:51:39,388 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:51:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:39,523 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-14 13:51:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-14 13:51:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:39,524 INFO L225 Difference]: With dead ends: 113 [2023-02-14 13:51:39,524 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 13:51:39,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:39,524 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:39,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 13:51:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-14 13:51:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-02-14 13:51:39,526 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2023-02-14 13:51:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:39,526 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-02-14 13:51:39,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:51:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-02-14 13:51:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:51:39,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:39,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:51:39,527 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2023-02-14 13:51:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194759240] [2023-02-14 13:51:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:51:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:39,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194759240] [2023-02-14 13:51:39,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194759240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:39,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:39,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:51:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688837211] [2023-02-14 13:51:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:39,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:51:39,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:39,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:51:39,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:51:39,721 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:51:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:39,849 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-02-14 13:51:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:51:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-14 13:51:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:39,850 INFO L225 Difference]: With dead ends: 91 [2023-02-14 13:51:39,851 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 13:51:39,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:51:39,851 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:39,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 275 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:51:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 13:51:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-14 13:51:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-14 13:51:39,853 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2023-02-14 13:51:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:39,853 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-14 13:51:39,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:51:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-14 13:51:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:51:39,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:39,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:39,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 13:51:39,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2023-02-14 13:51:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:39,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687084327] [2023-02-14 13:51:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:51:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687084327] [2023-02-14 13:51:40,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687084327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038426776] [2023-02-14 13:51:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:40,397 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-14 13:51:40,399 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-14 13:51:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:40,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 13:51:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:40,618 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-14 13:51:40,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-14 13:51:40,866 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2357 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2357) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:51:40,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:40,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:51:40,910 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-14 13:51:40,911 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 23 treesize of output 24 [2023-02-14 13:51:40,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-14 13:51:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:51:40,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:41,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038426776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:41,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:41,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2023-02-14 13:51:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28786910] [2023-02-14 13:51:41,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:41,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 13:51:41,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:41,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 13:51:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2023-02-14 13:51:41,018 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:41,545 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-14 13:51:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 13:51:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-14 13:51:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:41,546 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:51:41,546 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:51:41,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=842, Unknown=1, NotChecked=60, Total=1056 [2023-02-14 13:51:41,547 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 446 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:41,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 455 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 663 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2023-02-14 13:51:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:51:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-14 13:51:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-14 13:51:41,549 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-14 13:51:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:41,549 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-14 13:51:41,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-14 13:51:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:51:41,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:41,550 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:41,565 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-14 13:51:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 13:51:41,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2023-02-14 13:51:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249962014] [2023-02-14 13:51:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:42,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249962014] [2023-02-14 13:51:42,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249962014] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:42,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063196891] [2023-02-14 13:51:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:42,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:42,654 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-14 13:51:42,682 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-14 13:51:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-14 13:51:42,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:42,877 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-14 13:51:43,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-14 13:51:43,176 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 21 treesize of output 13 [2023-02-14 13:51:43,345 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2605 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2605) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2604 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2604))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2599 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2599) |c_#length|)))) is different from true [2023-02-14 13:51:43,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:43,381 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 31 treesize of output 31 [2023-02-14 13:51:43,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:43,388 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 22 treesize of output 24 [2023-02-14 13:51:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:43,393 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 31 treesize of output 31 [2023-02-14 13:51:43,412 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:51:43,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 13:51:43,467 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 23 treesize of output 15 [2023-02-14 13:51:43,470 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 28 treesize of output 16 [2023-02-14 13:51:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:51:43,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063196891] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:44,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:44,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-02-14 13:51:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714245647] [2023-02-14 13:51:44,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 13:51:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 13:51:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1024, Unknown=2, NotChecked=64, Total=1190 [2023-02-14 13:51:44,303 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:45,640 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-14 13:51:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 13:51:45,640 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-14 13:51:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:45,641 INFO L225 Difference]: With dead ends: 89 [2023-02-14 13:51:45,641 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 13:51:45,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=228, Invalid=1841, Unknown=5, NotChecked=88, Total=2162 [2023-02-14 13:51:45,642 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 316 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:45,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 892 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1234 Invalid, 3 Unknown, 92 Unchecked, 0.7s Time] [2023-02-14 13:51:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 13:51:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-14 13:51:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-14 13:51:45,644 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-14 13:51:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:45,644 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-14 13:51:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-14 13:51:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:51:45,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:45,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:45,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 13:51:45,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:45,850 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2023-02-14 13:51:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:45,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213199798] [2023-02-14 13:51:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:46,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213199798] [2023-02-14 13:51:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213199798] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971443799] [2023-02-14 13:51:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:46,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:46,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:46,993 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:51:46,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:51:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:47,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-14 13:51:47,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:47,237 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-14 13:51:47,430 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-14 13:51:47,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:47,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:47,549 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 29 treesize of output 14 [2023-02-14 13:51:47,553 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-14 13:51:47,687 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2860)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 13:51:47,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:47,738 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:51:47,738 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 35 treesize of output 41 [2023-02-14 13:51:47,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:47,749 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 40 treesize of output 38 [2023-02-14 13:51:47,774 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-14 13:51:47,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2023-02-14 13:51:47,852 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 41 treesize of output 25 [2023-02-14 13:51:47,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:47,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:47,895 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 38 treesize of output 17 [2023-02-14 13:51:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:51:47,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:48,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971443799] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:48,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:48,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2023-02-14 13:51:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212127010] [2023-02-14 13:51:48,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:48,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:51:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:51:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1144, Unknown=1, NotChecked=68, Total=1332 [2023-02-14 13:51:48,085 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:51:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:49,694 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2023-02-14 13:51:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:51:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2023-02-14 13:51:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:49,695 INFO L225 Difference]: With dead ends: 147 [2023-02-14 13:51:49,695 INFO L226 Difference]: Without dead ends: 147 [2023-02-14 13:51:49,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2233, Unknown=1, NotChecked=98, Total=2652 [2023-02-14 13:51:49,696 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 469 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:49,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1085 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1290 Invalid, 0 Unknown, 136 Unchecked, 0.8s Time] [2023-02-14 13:51:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-14 13:51:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2023-02-14 13:51:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-14 13:51:49,698 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2023-02-14 13:51:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:49,698 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-14 13:51:49,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:51:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-14 13:51:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:51:49,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:49,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:49,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 13:51:49,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:49,904 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2023-02-14 13:51:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:49,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780007366] [2023-02-14 13:51:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780007366] [2023-02-14 13:51:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780007366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:51,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936972841] [2023-02-14 13:51:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:51,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:51,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:51:51,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:51:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:51,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-14 13:51:51,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:52,013 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-14 13:51:52,379 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-14 13:51:52,383 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-14 13:51:52,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:52,561 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 57 treesize of output 32 [2023-02-14 13:51:52,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:52,567 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 1 case distinctions, treesize of input 26 treesize of output 14 [2023-02-14 13:51:52,765 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3117 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3117))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3111 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3111) |c_#length|)) (exists ((v_ArrVal_3116 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3116) |c_#memory_$Pointer$.offset|)))) is different from true [2023-02-14 13:51:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:52,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:52,810 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:51:52,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-14 13:51:52,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:52,816 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 30 treesize of output 32 [2023-02-14 13:51:52,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:52,827 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:51:52,827 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 63 treesize of output 59 [2023-02-14 13:51:52,841 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-02-14 13:51:52,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-02-14 13:51:52,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:51:52,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:51:52,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 41 [2023-02-14 13:51:52,985 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 13:51:52,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2023-02-14 13:51:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:51:53,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:53,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936972841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:53,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:53,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2023-02-14 13:51:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138970321] [2023-02-14 13:51:53,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:53,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-14 13:51:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-14 13:51:53,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2023-02-14 13:51:53,433 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:51:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:55,906 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2023-02-14 13:51:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:51:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2023-02-14 13:51:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:55,907 INFO L225 Difference]: With dead ends: 130 [2023-02-14 13:51:55,907 INFO L226 Difference]: Without dead ends: 130 [2023-02-14 13:51:55,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=346, Invalid=3946, Unknown=2, NotChecked=128, Total=4422 [2023-02-14 13:51:55,909 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 226 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:55,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1913 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2398 Invalid, 0 Unknown, 90 Unchecked, 1.4s Time] [2023-02-14 13:51:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-14 13:51:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2023-02-14 13:51:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-14 13:51:55,912 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2023-02-14 13:51:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:55,913 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-14 13:51:55,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:51:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-14 13:51:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:51:55,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:55,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:55,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 13:51:56,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 13:51:56,121 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2023-02-14 13:51:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:56,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440823700] [2023-02-14 13:51:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 13:51:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:56,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440823700] [2023-02-14 13:51:56,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440823700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:56,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:56,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:51:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536149112] [2023-02-14 13:51:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:56,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:51:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:51:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:51:56,333 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:56,534 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2023-02-14 13:51:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 13:51:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-14 13:51:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:56,536 INFO L225 Difference]: With dead ends: 150 [2023-02-14 13:51:56,536 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 13:51:56,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:51:56,536 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 264 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:56,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 380 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 13:51:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2023-02-14 13:51:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-14 13:51:56,538 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2023-02-14 13:51:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:56,539 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-14 13:51:56,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-14 13:51:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:51:56,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:56,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:56,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-14 13:51:56,539 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2023-02-14 13:51:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:56,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161234148] [2023-02-14 13:51:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:51:56,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:56,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161234148] [2023-02-14 13:51:56,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161234148] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:56,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:56,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 13:51:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602280146] [2023-02-14 13:51:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:56,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:51:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:51:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:51:56,888 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:57,111 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-14 13:51:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:51:57,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-14 13:51:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:57,112 INFO L225 Difference]: With dead ends: 132 [2023-02-14 13:51:57,112 INFO L226 Difference]: Without dead ends: 132 [2023-02-14 13:51:57,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:51:57,113 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 167 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:57,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 429 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-14 13:51:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2023-02-14 13:51:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-02-14 13:51:57,115 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2023-02-14 13:51:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:57,115 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-02-14 13:51:57,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-02-14 13:51:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 13:51:57,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:57,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:57,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 13:51:57,116 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2023-02-14 13:51:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115783860] [2023-02-14 13:51:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:57,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:51:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115783860] [2023-02-14 13:51:57,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115783860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:57,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658530137] [2023-02-14 13:51:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:51:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:51:57,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:51:57,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:51:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:57,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 13:51:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:51:57,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-14 13:51:57,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3729 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3729)))) is different from true [2023-02-14 13:51:58,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:51:58,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-14 13:51:58,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:51:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:51:58,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:51:58,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658530137] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:51:58,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:51:58,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-14 13:51:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696207] [2023-02-14 13:51:58,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:51:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:51:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:51:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=614, Unknown=5, NotChecked=50, Total=756 [2023-02-14 13:51:58,133 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:58,604 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-14 13:51:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 13:51:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-14 13:51:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:58,605 INFO L225 Difference]: With dead ends: 83 [2023-02-14 13:51:58,605 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 13:51:58,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=956, Unknown=5, NotChecked=64, Total=1190 [2023-02-14 13:51:58,606 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 323 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:58,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 653 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2023-02-14 13:51:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 13:51:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-14 13:51:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-14 13:51:58,609 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2023-02-14 13:51:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:58,609 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-14 13:51:58,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:51:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-14 13:51:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 13:51:58,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:58,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:58,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-14 13:51:58,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-14 13:51:58,830 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2023-02-14 13:51:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:58,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361578891] [2023-02-14 13:51:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:59,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:51:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:51:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:51:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:51:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:51:59,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:51:59,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361578891] [2023-02-14 13:51:59,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361578891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:51:59,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:51:59,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-14 13:51:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616081397] [2023-02-14 13:51:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:51:59,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:51:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:51:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:51:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:51:59,510 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:51:59,810 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-14 13:51:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 13:51:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-14 13:51:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:51:59,811 INFO L225 Difference]: With dead ends: 100 [2023-02-14 13:51:59,811 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 13:51:59,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2023-02-14 13:51:59,812 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 352 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:51:59,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 416 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:51:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 13:51:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-14 13:51:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:51:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-14 13:51:59,814 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2023-02-14 13:51:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:51:59,814 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-14 13:51:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:51:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-14 13:51:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 13:51:59,814 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:51:59,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:51:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-14 13:51:59,814 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:51:59,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:51:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2023-02-14 13:51:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:51:59,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75727879] [2023-02-14 13:51:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:51:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:51:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:52:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75727879] [2023-02-14 13:52:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75727879] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042985271] [2023-02-14 13:52:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:01,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:01,222 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:01,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:52:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:01,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 13:52:01,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:01,671 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-14 13:52:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:01,899 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-14 13:52:02,128 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:52:02,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2023-02-14 13:52:02,144 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:52:02,144 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2023-02-14 13:52:02,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:02,268 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:52:02,269 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 29 treesize of output 38 [2023-02-14 13:52:02,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:02,281 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:52:02,281 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 47 treesize of output 52 [2023-02-14 13:52:02,303 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 11 [2023-02-14 13:52:02,310 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-14 13:52:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:02,402 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-14 13:52:02,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:02,405 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 29 treesize of output 29 [2023-02-14 13:52:02,499 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 23 treesize of output 15 [2023-02-14 13:52:02,503 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 26 treesize of output 14 [2023-02-14 13:52:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 13:52:02,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:52:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042985271] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:52:02,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:52:02,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2023-02-14 13:52:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651691905] [2023-02-14 13:52:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:52:02,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:52:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:52:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:52:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1440, Unknown=1, NotChecked=0, Total=1560 [2023-02-14 13:52:02,556 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:52:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:52:03,405 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-14 13:52:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:52:03,406 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-14 13:52:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:52:03,406 INFO L225 Difference]: With dead ends: 81 [2023-02-14 13:52:03,407 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 13:52:03,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=288, Invalid=2467, Unknown=1, NotChecked=0, Total=2756 [2023-02-14 13:52:03,408 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 431 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:52:03,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 373 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 483 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:52:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 13:52:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-14 13:52:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:52:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-14 13:52:03,410 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2023-02-14 13:52:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:52:03,410 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-14 13:52:03,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:52:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-14 13:52:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 13:52:03,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:52:03,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:52:03,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 13:52:03,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:03,617 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:52:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:52:03,618 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2023-02-14 13:52:03,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:52:03,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155459533] [2023-02-14 13:52:03,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:03,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:52:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:52:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155459533] [2023-02-14 13:52:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155459533] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620914538] [2023-02-14 13:52:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:04,486 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:04,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 13:52:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:04,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 13:52:04,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:04,978 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-14 13:52:05,021 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4458 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4458)))) is different from true [2023-02-14 13:52:05,032 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4459 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4459)))) is different from true [2023-02-14 13:52:05,037 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4460)))) is different from true [2023-02-14 13:52:05,041 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4460 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4460) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:52:05,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:05,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:52:05,189 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 13:52:05,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2023-02-14 13:52:05,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:05,259 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 13:52:05,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-02-14 13:52:05,265 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-14 13:52:05,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:05,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:52:05,354 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:05,355 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 29 treesize of output 30 [2023-02-14 13:52:05,394 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 26 treesize of output 14 [2023-02-14 13:52:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-02-14 13:52:05,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:52:05,417 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-14 13:52:05,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:52:05,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-14 13:52:05,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 13:52:05,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4464 (Array Int Int)) (v_ArrVal_4465 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4464))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-14 13:52:05,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4464))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-14 13:52:05,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)))) is different from false [2023-02-14 13:52:05,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4464 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4465 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_4470 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4470))) (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_4464))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))))) is different from false [2023-02-14 13:52:05,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620914538] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:05,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:52:05,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2023-02-14 13:52:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787262954] [2023-02-14 13:52:05,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:52:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-14 13:52:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:52:05,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-14 13:52:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1236, Unknown=10, NotChecked=790, Total=2162 [2023-02-14 13:52:05,500 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:52:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:52:06,777 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-02-14 13:52:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:52:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-02-14 13:52:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:52:06,778 INFO L225 Difference]: With dead ends: 103 [2023-02-14 13:52:06,778 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 13:52:06,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=2589, Unknown=10, NotChecked=1150, Total=4160 [2023-02-14 13:52:06,779 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 705 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:52:06,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 750 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1228 Invalid, 0 Unknown, 351 Unchecked, 0.5s Time] [2023-02-14 13:52:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 13:52:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-14 13:52:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:52:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-14 13:52:06,783 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2023-02-14 13:52:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:52:06,783 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-14 13:52:06,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:52:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-14 13:52:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 13:52:06,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:52:06,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:52:06,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 13:52:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 13:52:06,984 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:52:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:52:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2023-02-14 13:52:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:52:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311650876] [2023-02-14 13:52:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:52:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:52:08,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:08,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311650876] [2023-02-14 13:52:08,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311650876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:08,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523456782] [2023-02-14 13:52:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:08,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:08,989 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:08,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 13:52:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:09,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-14 13:52:09,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:09,253 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-14 13:52:09,294 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-14 13:52:09,375 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:52:09,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:52:09,444 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-14 13:52:09,453 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-14 13:52:09,772 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-14 13:52:09,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:52:09,956 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 38 treesize of output 21 [2023-02-14 13:52:09,959 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-14 13:52:09,961 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-14 13:52:09,965 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-14 13:52:10,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:10,375 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-14 13:52:10,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:10,389 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:10,389 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 46 treesize of output 48 [2023-02-14 13:52:10,402 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:52:10,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-14 13:52:10,416 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:52:10,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 13:52:10,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:10,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:52:10,909 INFO L321 Elim1Store]: treesize reduction 88, result has 30.2 percent of original size [2023-02-14 13:52:10,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 83 [2023-02-14 13:52:10,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2023-02-14 13:52:11,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,085 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 13:52:11,086 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 100 treesize of output 92 [2023-02-14 13:52:11,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,104 INFO L321 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2023-02-14 13:52:11,104 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 91 [2023-02-14 13:52:11,134 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-14 13:52:11,155 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-14 13:52:11,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,318 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 13:52:11,318 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 88 treesize of output 82 [2023-02-14 13:52:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,335 INFO L321 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2023-02-14 13:52:11,336 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 2 case distinctions, treesize of input 59 treesize of output 76 [2023-02-14 13:52:11,673 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-14 13:52:11,674 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 135 treesize of output 108 [2023-02-14 13:52:11,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:11,694 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2023-02-14 13:52:11,694 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 70 treesize of output 85 [2023-02-14 13:52:11,740 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-14 13:52:11,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:52:11,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 93 [2023-02-14 13:52:11,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-14 13:52:11,931 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-14 13:52:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:52:12,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:52:12,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4772 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-14 13:52:12,326 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (v_ArrVal_4769 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse0 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-14 13:52:12,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:52:12,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse0 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse2 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:52:12,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-14 13:52:12,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-14 13:52:12,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (and (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4770 (Array Int Int)) (v_ArrVal_4771 (Array Int Int)) (v_ArrVal_4772 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4769 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4769))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse1 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4770) .cse3 v_ArrVal_4772) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4771) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-14 13:52:12,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523456782] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:12,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:52:12,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 54 [2023-02-14 13:52:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906334604] [2023-02-14 13:52:12,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:52:12,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-14 13:52:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:52:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-14 13:52:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3328, Unknown=34, NotChecked=854, Total=4422 [2023-02-14 13:52:12,801 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:52:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:52:17,249 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2023-02-14 13:52:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:52:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-02-14 13:52:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:52:17,255 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:52:17,255 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 13:52:17,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=601, Invalid=6198, Unknown=35, NotChecked=1176, Total=8010 [2023-02-14 13:52:17,259 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 874 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:52:17,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 941 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1979 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 13:52:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 13:52:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-02-14 13:52:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:52:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-14 13:52:17,262 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2023-02-14 13:52:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:52:17,262 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-14 13:52:17,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 47 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 13:52:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-14 13:52:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 13:52:17,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:52:17,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:52:17,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 13:52:17,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-14 13:52:17,471 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:52:17,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:52:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2023-02-14 13:52:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:52:17,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042176622] [2023-02-14 13:52:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:17,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:52:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:52:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:20,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042176622] [2023-02-14 13:52:20,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042176622] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:20,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846197319] [2023-02-14 13:52:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:20,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:20,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:20,162 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:20,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 13:52:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:20,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 154 conjunts are in the unsatisfiable core [2023-02-14 13:52:20,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:20,453 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-14 13:52:20,497 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-14 13:52:20,619 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:52:20,620 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-14 13:52:20,741 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-14 13:52:20,820 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-14 13:52:20,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:20,963 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:52:20,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-14 13:52:21,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:52:21,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:52:21,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:52:21,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:21,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:52:21,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:52:21,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:52:21,764 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 69 treesize of output 32 [2023-02-14 13:52:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:21,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-14 13:52:21,774 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-14 13:52:21,777 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-14 13:52:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,219 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:22,220 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 77 treesize of output 65 [2023-02-14 13:52:22,233 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:52:22,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-14 13:52:22,239 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-14 13:52:22,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,257 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:52:22,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-14 13:52:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:52:22,834 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-14 13:52:22,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 110 [2023-02-14 13:52:22,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:22,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 49 [2023-02-14 13:52:22,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,854 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 32 treesize of output 34 [2023-02-14 13:52:22,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,879 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-14 13:52:22,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,897 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:22,897 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 75 treesize of output 63 [2023-02-14 13:52:22,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:52:22,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,963 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:22,963 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 75 treesize of output 63 [2023-02-14 13:52:22,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:52:22,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:22,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:52:23,159 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:23,160 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 94 treesize of output 75 [2023-02-14 13:52:23,164 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 13 [2023-02-14 13:52:23,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:23,169 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 37 treesize of output 32 [2023-02-14 13:52:23,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:23,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:52:23,251 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 28 treesize of output 16 [2023-02-14 13:52:23,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:52:23,366 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-14 13:52:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:52:23,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:52:23,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5100 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_5097)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2023-02-14 13:52:23,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5100 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-14 13:52:23,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-14 13:52:23,557 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-02-14 13:52:23,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse3 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-02-14 13:52:23,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-14 13:52:23,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-14 13:52:23,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5089) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5095))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5090) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_5088) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-02-14 13:52:23,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5090 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5094 (Array Int Int)) (v_ArrVal_5096 (Array Int Int)) (v_ArrVal_5088 (Array Int Int)) (v_ArrVal_5097 Int) (v_ArrVal_5099 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| Int) (v_ArrVal_5089 (Array Int Int)) (v_ArrVal_5100 (Array Int Int)) (v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5113 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5114)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5115))) (let ((.cse3 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse6 .cse3 v_ArrVal_5089) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5095))) (let ((.cse2 (store (store .cse5 .cse3 v_ArrVal_5090) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5096)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5113) .cse3 v_ArrVal_5088) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5094))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_5097))) (select (select (store .cse4 .cse1 v_ArrVal_5099) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_5100) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) is different from false [2023-02-14 13:52:23,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846197319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:23,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:52:23,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2023-02-14 13:52:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416753847] [2023-02-14 13:52:23,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:52:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-14 13:52:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:52:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-14 13:52:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=4694, Unknown=17, NotChecked=1314, Total=6320 [2023-02-14 13:52:23,705 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 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-14 13:52:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:52:27,700 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-02-14 13:52:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-14 13:52:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 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 61 [2023-02-14 13:52:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:52:27,701 INFO L225 Difference]: With dead ends: 103 [2023-02-14 13:52:27,701 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 13:52:27,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=750, Invalid=8198, Unknown=18, NotChecked=1746, Total=10712 [2023-02-14 13:52:27,703 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 601 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:52:27,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1112 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2204 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 13:52:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 13:52:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-14 13:52:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:52:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-14 13:52:27,705 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2023-02-14 13:52:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:52:27,705 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-14 13:52:27,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 60 states have internal predecessors, (108), 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-14 13:52:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-14 13:52:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 13:52:27,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:52:27,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:52:27,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 13:52:27,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-14 13:52:27,912 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:52:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:52:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2023-02-14 13:52:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:52:27,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777066058] [2023-02-14 13:52:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:52:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:52:31,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:31,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777066058] [2023-02-14 13:52:31,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777066058] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:31,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320333047] [2023-02-14 13:52:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:31,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:31,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 13:52:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:31,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 140 conjunts are in the unsatisfiable core [2023-02-14 13:52:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:31,577 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-14 13:52:31,617 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-14 13:52:31,744 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:52:31,744 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-14 13:52:31,848 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-14 13:52:31,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:31,983 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:52:31,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-14 13:52:32,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:52:32,236 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:32,236 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 43 treesize of output 40 [2023-02-14 13:52:32,407 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:32,407 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 39 treesize of output 35 [2023-02-14 13:52:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2023-02-14 13:52:32,666 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:52:32,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 28 [2023-02-14 13:52:32,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:32,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-14 13:52:32,674 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-14 13:52:33,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,079 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:33,079 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 85 treesize of output 63 [2023-02-14 13:52:33,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,105 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 13:52:33,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2023-02-14 13:52:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:52:33,774 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-14 13:52:33,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 158 treesize of output 121 [2023-02-14 13:52:33,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:33,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2023-02-14 13:52:33,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,812 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-14 13:52:33,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,825 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:33,825 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 105 treesize of output 75 [2023-02-14 13:52:33,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,878 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-14 13:52:33,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:33,888 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:33,889 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 105 treesize of output 75 [2023-02-14 13:52:34,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:52:34,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:34,053 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:52:34,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 78 [2023-02-14 13:52:34,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:34,064 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 43 treesize of output 43 [2023-02-14 13:52:34,193 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-14 13:52:34,430 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:52:34,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 48 [2023-02-14 13:52:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:52:34,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:52:34,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2023-02-14 13:52:34,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5420 (Array Int Int)) (v_ArrVal_5417 (Array Int Int)) (v_ArrVal_5416 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5416))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_5420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2023-02-14 13:52:35,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320333047] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:35,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:52:35,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2023-02-14 13:52:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593390311] [2023-02-14 13:52:35,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:52:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-14 13:52:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:52:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-14 13:52:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=5579, Unknown=44, NotChecked=302, Total=6162 [2023-02-14 13:52:35,601 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:52:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:52:43,110 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2023-02-14 13:52:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-14 13:52:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-14 13:52:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:52:43,111 INFO L225 Difference]: With dead ends: 141 [2023-02-14 13:52:43,111 INFO L226 Difference]: Without dead ends: 141 [2023-02-14 13:52:43,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=783, Invalid=10310, Unknown=45, NotChecked=418, Total=11556 [2023-02-14 13:52:43,112 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 642 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:52:43,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1069 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2633 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2023-02-14 13:52:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-14 13:52:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2023-02-14 13:52:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:52:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-14 13:52:43,115 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2023-02-14 13:52:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:52:43,115 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-14 13:52:43,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 1.8) internal successors, (117), 61 states have internal predecessors, (117), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:52:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-14 13:52:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 13:52:43,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:52:43,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:52:43,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 13:52:43,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:43,321 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:52:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:52:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2023-02-14 13:52:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:52:43,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266626240] [2023-02-14 13:52:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:52:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:52:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:52:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:52:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:52:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:52:48,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266626240] [2023-02-14 13:52:48,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266626240] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:52:48,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714740035] [2023-02-14 13:52:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:52:48,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:52:48,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:52:48,332 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:52:48,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 13:52:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:52:48,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-14 13:52:48,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:52:48,684 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-14 13:52:48,957 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-14 13:52:48,960 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-14 13:52:49,176 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:52:49,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 13:52:49,210 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:52:49,210 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-14 13:52:49,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:52:49,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:52:49,492 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:49,492 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 61 treesize of output 54 [2023-02-14 13:52:49,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:52:49,704 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:52:49,704 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 47 treesize of output 41 [2023-02-14 13:52:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:49,721 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-14 13:52:49,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:49,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:52:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:49,815 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 51 treesize of output 34 [2023-02-14 13:52:50,134 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:52:50,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 46 [2023-02-14 13:52:50,140 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-14 13:52:50,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 13:52:50,147 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-14 13:52:50,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:52:50,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,597 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 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-14 13:52:50,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:50,609 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:52:50,609 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 121 treesize of output 89 [2023-02-14 13:52:50,640 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:52:50,640 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-14 13:52:51,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:52:51,335 INFO L321 Elim1Store]: treesize reduction 134, result has 18.8 percent of original size [2023-02-14 13:52:51,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 172 treesize of output 97 [2023-02-14 13:52:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,358 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:52:51,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 92 [2023-02-14 13:52:51,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,528 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:52:51,529 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 146 treesize of output 114 [2023-02-14 13:52:51,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2023-02-14 13:52:51,614 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-14 13:52:51,615 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 226 treesize of output 133 [2023-02-14 13:52:51,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,637 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:52:51,637 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 158 treesize of output 150 [2023-02-14 13:52:51,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:51,981 INFO L321 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2023-02-14 13:52:51,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 228 treesize of output 107 [2023-02-14 13:52:51,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:52,000 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:52:52,001 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 2 case distinctions, treesize of input 55 treesize of output 44 [2023-02-14 13:52:52,450 INFO L321 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2023-02-14 13:52:52,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 63 [2023-02-14 13:52:52,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:52:52,649 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:52:52,649 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 26 treesize of output 16 [2023-02-14 13:52:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:52:52,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:10,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714740035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:10,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:53:10,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 74 [2023-02-14 13:53:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680316907] [2023-02-14 13:53:10,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:10,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-14 13:53:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-14 13:53:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=7405, Unknown=97, NotChecked=0, Total=7832 [2023-02-14 13:53:10,278 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 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-14 13:53:15,038 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-14 13:53:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:22,274 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2023-02-14 13:53:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-14 13:53:22,274 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-14 13:53:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:22,275 INFO L225 Difference]: With dead ends: 157 [2023-02-14 13:53:22,275 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 13:53:22,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=957, Invalid=12988, Unknown=97, NotChecked=0, Total=14042 [2023-02-14 13:53:22,279 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1028 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:22,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1214 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3063 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-02-14 13:53:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 13:53:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 90. [2023-02-14 13:53:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:53:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-14 13:53:22,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2023-02-14 13:53:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:22,282 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-14 13:53:22,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 66 states have internal predecessors, (116), 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-14 13:53:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-14 13:53:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 13:53:22,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:22,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:22,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-14 13:53:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:22,489 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:53:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2023-02-14 13:53:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:22,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547371749] [2023-02-14 13:53:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:53:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:53:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:53:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:53:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:24,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547371749] [2023-02-14 13:53:24,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547371749] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:24,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529885332] [2023-02-14 13:53:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:24,863 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:53:24,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 13:53:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:25,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 136 conjunts are in the unsatisfiable core [2023-02-14 13:53:25,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:25,184 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-14 13:53:25,224 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-14 13:53:25,352 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) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2023-02-14 13:53:25,354 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) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2023-02-14 13:53:25,366 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-02-14 13:53:25,368 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-02-14 13:53:25,399 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-02-14 13:53:25,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-02-14 13:53:25,417 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |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-14 13:53:25,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |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-14 13:53:25,496 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |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)) is different from false [2023-02-14 13:53:25,498 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |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)) is different from true [2023-02-14 13:53:25,557 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from false [2023-02-14 13:53:25,560 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1))))))) is different from true [2023-02-14 13:53:25,600 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from false [2023-02-14 13:53:25,602 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1))))) is different from true [2023-02-14 13:53:25,631 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-14 13:53:25,654 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-02-14 13:53:25,657 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-14 13:53:25,722 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:53:25,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-14 13:53:25,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from false [2023-02-14 13:53:25,753 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))) is different from true [2023-02-14 13:53:25,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-14 13:53:25,793 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:53:25,854 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:53:25,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 13:53:25,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:25,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-02-14 13:53:25,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2023-02-14 13:53:25,915 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2023-02-14 13:53:25,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from false [2023-02-14 13:53:25,970 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse3 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (= (select .cse3 0) .cse0)))) is different from true [2023-02-14 13:53:26,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from false [2023-02-14 13:53:26,023 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 4))) (and (< |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= .cse2 (select .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse0) 0))))))) is different from true [2023-02-14 13:53:26,047 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:53:26,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 25 [2023-02-14 13:53:26,052 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-14 13:53:26,074 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_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,077 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_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,122 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_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,125 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_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,210 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,213 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,257 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,260 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,303 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,306 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,350 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_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:26,353 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_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:26,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:26,423 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-14 13:53:26,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:26,452 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:26,452 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 100 treesize of output 80 [2023-02-14 13:53:26,573 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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2023-02-14 13:53:26,577 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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse2 (select .cse5 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0))) (= .cse2 (select .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2023-02-14 13:53:26,701 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:26,705 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:27,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:27,088 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:27,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:27,265 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:27,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from false [2023-02-14 13:53:27,451 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (select .cse6 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select .cse6 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from true [2023-02-14 13:53:27,525 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-14 13:53:27,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 113 [2023-02-14 13:53:27,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:53:27,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2023-02-14 13:53:27,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-02-14 13:53:27,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from false [2023-02-14 13:53:27,690 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_60))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0))))))) is different from true [2023-02-14 13:53:27,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:27,750 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:27,750 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 119 treesize of output 93 [2023-02-14 13:53:27,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:27,760 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 26 treesize of output 28 [2023-02-14 13:53:27,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:27,984 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:27,985 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 119 treesize of output 93 [2023-02-14 13:53:28,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:28,002 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 26 treesize of output 28 [2023-02-14 13:53:28,139 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-14 13:53:28,143 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-14 13:53:28,445 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-14 13:53:28,449 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-14 13:53:28,529 INFO L321 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2023-02-14 13:53:28,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 89 [2023-02-14 13:53:28,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:28,644 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 30 treesize of output 32 [2023-02-14 13:53:28,684 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 (+ 2 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-14 13:53:28,688 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 (+ 2 .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-14 13:53:28,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-14 13:53:29,077 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 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-14 13:53:29,081 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 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-14 13:53:29,250 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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:29,256 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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:29,642 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 ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from false [2023-02-14 13:53:29,646 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 ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 .cse7)) (.cse4 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse3 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse1 (select |v_#valid_BEFORE_CALL_47| .cse1)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse6 (select |v_#valid_BEFORE_CALL_43| .cse6)))) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse7 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse4)))))) is different from true [2023-02-14 13:53:29,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-14 13:53:29,820 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-14 13:53:29,865 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-02-14 13:53:29,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 64 [2023-02-14 13:53:30,006 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from false [2023-02-14 13:53:30,330 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|)))) is different from true [2023-02-14 13:53:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-02-14 13:53:30,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:30,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-14 13:53:30,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-14 13:53:30,374 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2023-02-14 13:53:30,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse0 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2023-02-14 13:53:30,393 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-14 13:53:30,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-14 13:53:30,411 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-14 13:53:30,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6053) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6054) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-14 13:53:30,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| Int) (v_ArrVal_6070 (Array Int Int)) (v_ArrVal_6061 (Array Int Int)) (v_ArrVal_6071 (Array Int Int)) (v_ArrVal_6059 Int) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39|) 0)) (not (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6071)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6070))) (let ((.cse6 (select (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse7 .cse6 v_ArrVal_6053) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6057))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store .cse5 .cse6 v_ArrVal_6054) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| v_ArrVal_6058))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6059)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store .cse2 .cse3 v_ArrVal_6061) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_39| |c_#StackHeapBarrier|)))) is different from false [2023-02-14 13:53:30,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529885332] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:30,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:53:30,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2023-02-14 13:53:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693424737] [2023-02-14 13:53:30,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:30,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-14 13:53:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-14 13:53:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1617, Unknown=75, NotChecked=5082, Total=6972 [2023-02-14 13:53:30,499 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:53:30,788 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) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2023-02-14 13:53:30,789 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) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2023-02-14 13:53:30,792 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_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2023-02-14 13:53:30,793 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_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2023-02-14 13:53:30,796 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |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|)) is different from false [2023-02-14 13:53:30,797 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |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|)) is different from true [2023-02-14 13:53:30,800 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-02-14 13:53:30,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |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| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-02-14 13:53:30,805 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |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_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from false [2023-02-14 13:53:30,806 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse3 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse3)) (= |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_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:53:30,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from false [2023-02-14 13:53:30,816 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse2 |c_node_create_#res#1.base|)))) is different from true [2023-02-14 13:53:30,824 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-02-14 13:53:30,826 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-02-14 13:53:30,834 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-02-14 13:53:30,836 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-02-14 13:53:30,845 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-02-14 13:53:30,847 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-02-14 13:53:30,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-02-14 13:53:30,864 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-02-14 13:53:30,872 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:30,874 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= 0 (select |v_old(#valid)_AFTER_CALL_53| .cse1)) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse3 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:30,883 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from false [2023-02-14 13:53:30,885 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_43| .cse1)))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))))) is different from true [2023-02-14 13:53:30,892 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2023-02-14 13:53:30,894 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse3 .cse0) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2023-02-14 13:53:30,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from false [2023-02-14 13:53:30,904 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse5 0)) (.cse2 (select .cse5 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (< |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) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (= (select |c_#valid| .cse1) 1) (= .cse2 .cse0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0))))))) is different from true [2023-02-14 13:53:30,912 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)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:30,914 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)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:30,924 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_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from false [2023-02-14 13:53:30,926 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_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_43| .cse0)))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0)))) is different from true [2023-02-14 13:53:30,947 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-14 13:53:30,950 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_6047 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6047) |c_#memory_$Pointer$.offset|)) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6048 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6048) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:53:30,961 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-14 13:53:30,963 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((v_ArrVal_6050 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6050))) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (exists ((v_ArrVal_6049 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:53:30,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from false [2023-02-14 13:53:30,986 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6052))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= (select .cse1 |c_node_create_~temp~0#1.offset|) 0) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_43| .cse3)))))) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6051 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6051))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse1) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:53:31,039 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|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from false [2023-02-14 13:53:31,043 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|)) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_ArrVal_6052 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6052))) (= |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_43| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_43| .cse2)))))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (exists ((v_ArrVal_6051 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6051) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimCell_290 Int)) (and (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimCell_290) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (< v_arrayElimIndex_60 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_290) 0) (= (select |v_#valid_BEFORE_CALL_44| v_arrayElimIndex_60) 0))))) is different from true [2023-02-14 13:53:31,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (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) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2023-02-14 13:53:31,091 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse4 (select .cse7 4)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (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) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse6) 0))) (= .cse4 (select .cse7 0)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse11 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) .cse1 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= .cse8 .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse11 0)))))) (= .cse8 0)))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse13 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse12 (select |v_#valid_BEFORE_CALL_47| .cse12)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse13 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse13 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_43| .cse14)))) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2023-02-14 13:53:31,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:31,131 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse0 (+ 2 .cse14)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse12 4)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse6 4))) (and .cse1 .cse2 (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse4)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse6 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) (= .cse3 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (+ 2 v_arrayElimIndex_60))) (and (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_47| .cse8)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse1 .cse2 (= .cse11 (select .cse12 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse14 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse14) 0))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:31,152 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from false [2023-02-14 13:53:31,155 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse0 (+ 2 .cse10)) (.cse7 (select .cse8 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_60))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse5 .cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (= .cse7 (select .cse8 0)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse7) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse10 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse10) 0))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse14 4))) (and .cse5 .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) (not (= .cse11 .cse12)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse14 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))))))))) is different from true [2023-02-14 13:53:31,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from false [2023-02-14 13:53:31,231 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse13 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (not (= .cse10 .cse13)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))))) is different from true [2023-02-14 13:53:31,277 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (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) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,281 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse0 (+ 2 .cse13)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse10 (select .cse11 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse3)) (= (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) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse9 .cse1))) (= .cse10 (select .cse11 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse10) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse13 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse13) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,344 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse12)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ 2 .cse12)) (.cse9 (select .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse1 (+ .cse2 4))) (= (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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse8)) (= .cse9 (select .cse10 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse9) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,401 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,405 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (let ((.cse10 (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| .cse12))) (let ((.cse0 (+ 2 .cse12)) (.cse8 (select .cse9 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select .cse1 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#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) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_60))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse8 (select .cse9 0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_44| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse12 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse12) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))) (not (= .cse10 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,454 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,488 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_60))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse7 (select |v_#valid_BEFORE_CALL_47| .cse7)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,548 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2023-02-14 13:53:31,552 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ 2 .cse11)) (.cse4 (select .cse5 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse3) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= .cse4 (select .cse5 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse8 (+ 2 v_arrayElimIndex_60))) (and (= (select |v_old(#valid)_AFTER_CALL_53| .cse4) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse6 (select |v_#valid_BEFORE_CALL_47| .cse6)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse9 (select |v_#valid_BEFORE_CALL_44| .cse9))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse11) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse11 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2023-02-14 13:53:31,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-14 13:53:31,615 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse0 (+ 2 .cse8)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse8) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse8 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse8) (not (= .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (= .cse3 (select .cse9 0)) (or (= .cse1 0) (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-14 13:53:31,702 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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-14 13:53:31,706 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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 .cse4)) (.cse2 (select .cse3 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select .cse3 .cse1) .cse4)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse6 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse7 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_47| .cse5)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse9 (select |v_#valid_BEFORE_CALL_43| .cse9)))) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse4 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-14 13:53:31,748 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 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from false [2023-02-14 13:53:31,752 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 (+ 2 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|) .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse3 (select |v_#valid_BEFORE_CALL_47| .cse3)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse2 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))))))) is different from true [2023-02-14 13:53:31,818 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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-14 13:53:31,822 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 (+ 2 .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-14 13:53:31,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from false [2023-02-14 13:53:31,860 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ 2 .cse1)) (.cse5 (select .cse8 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse2 (select |v_#valid_BEFORE_CALL_47| .cse2)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse5) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_43| .cse7)))) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (or (and (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse5)))))) is different from true [2023-02-14 13:53:31,896 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 ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from false [2023-02-14 13:53:31,900 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 ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ 2 .cse3)) (.cse1 (select .cse2 0))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse2 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_60))) (and (= |v_#valid_BEFORE_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_47| .cse4)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_44| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))))) is different from true [2023-02-14 13:53:31,941 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from false [2023-02-14 13:53:31,944 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (v_arrayElimCell_290 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_60)) (.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_57| .cse0 (select |v_#valid_BEFORE_CALL_47| .cse0)))) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimCell_290) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_47| v_arrayElimIndex_60) 0) (= (select (store |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_#t~mem17#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_43| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_10|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_57| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| v_arrayElimCell_290) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|))))) is different from true [2023-02-14 13:53:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:32,066 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-02-14 13:53:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-14 13:53:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-14 13:53:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:32,067 INFO L225 Difference]: With dead ends: 106 [2023-02-14 13:53:32,067 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 13:53:32,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 79 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=297, Invalid=1850, Unknown=149, NotChecked=12956, Total=15252 [2023-02-14 13:53:32,068 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1702 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:32,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 878 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 1702 Unchecked, 0.2s Time] [2023-02-14 13:53:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 13:53:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 13:53:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.223529411764706) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:53:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2023-02-14 13:53:32,071 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2023-02-14 13:53:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:32,071 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2023-02-14 13:53:32,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.591549295774648) internal successors, (113), 65 states have internal predecessors, (113), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 13:53:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2023-02-14 13:53:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-14 13:53:32,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:32,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:32,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 13:53:32,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-14 13:53:32,278 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:53:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2023-02-14 13:53:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121978157] [2023-02-14 13:53:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:53:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:53:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:53:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:53:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121978157] [2023-02-14 13:53:37,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121978157] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113989305] [2023-02-14 13:53:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:37,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:37,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:37,153 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:53:37,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 13:53:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:37,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 200 conjunts are in the unsatisfiable core [2023-02-14 13:53:37,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:37,551 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-14 13:53:37,624 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-14 13:53:37,931 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-14 13:53:37,934 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-14 13:53:38,433 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:53:38,433 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-14 13:53:38,442 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-14 13:53:38,657 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-14 13:53:38,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:53:38,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:53:38,819 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-14 13:53:38,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:53:38,834 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-14 13:53:39,089 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-14 13:53:39,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:53:39,110 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-14 13:53:39,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:39,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:53:39,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:39,137 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 53 treesize of output 36 [2023-02-14 13:53:39,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 18 treesize of output 20 [2023-02-14 13:53:39,516 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:53:39,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 48 [2023-02-14 13:53:39,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:39,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 13:53:39,526 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-14 13:53:39,529 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-14 13:53:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:40,104 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:40,104 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 123 treesize of output 91 [2023-02-14 13:53:40,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:40,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:40,120 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:53:40,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2023-02-14 13:53:40,142 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 13:53:40,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 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-14 13:53:40,149 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-14 13:53:40,165 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:53:40,165 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-14 13:53:41,083 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-14 13:53:41,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 208 treesize of output 161 [2023-02-14 13:53:41,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:53:41,109 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 13:53:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 91 [2023-02-14 13:53:41,117 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:53:41,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2023-02-14 13:53:41,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,255 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:41,255 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 121 treesize of output 89 [2023-02-14 13:53:41,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-14 13:53:41,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-14 13:53:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,347 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:41,347 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 121 treesize of output 89 [2023-02-14 13:53:41,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-14 13:53:41,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-14 13:53:41,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:53:41,684 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:53:41,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 99 [2023-02-14 13:53:41,694 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 26 treesize of output 28 [2023-02-14 13:53:41,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:41,709 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:53:41,710 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 2 case distinctions, treesize of input 80 treesize of output 65 [2023-02-14 13:53:42,383 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-14 13:53:42,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 52 [2023-02-14 13:53:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:42,390 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:53:42,390 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 33 treesize of output 19 [2023-02-14 13:53:42,550 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-14 13:53:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:42,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:43,887 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ 4 (select (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse3 (store .cse8 .cse1 (store (select .cse8 .cse1) .cse7 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse5 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 v_ArrVal_6399)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse5 .cse4) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) .cse2) (+ 8 (select (select .cse3 .cse4) .cse0)))) (= .cse2 .cse4)))))))))))) (forall ((v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse16 (+ 4 (select (select .cse17 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse14 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse16 v_ArrVal_6397)))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse16 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select .cse14 .cse13) .cse9))) (or (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse9)) (+ 8 .cse10)))))))) (not (<= 0 .cse9))))))))) is different from false [2023-02-14 13:53:43,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse6 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 v_ArrVal_6397)))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse2 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 v_ArrVal_6399)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse6 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse1 v_ArrVal_6400) (select (select .cse2 .cse3) .cse4)) (+ .cse5 8))) (= .cse5 .cse4)))))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse17 v_ArrVal_6397)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse16 .cse12 (store (select .cse16 .cse12) .cse17 v_ArrVal_6399)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse15 .cse10) .cse14))) (or (= .cse10 .cse11) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) .cse11) (+ (select (select .cse13 .cse10) .cse14) 8)))))))) (not (<= 0 .cse14)))))))))) is different from false [2023-02-14 13:53:44,021 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (store .cse9 .cse2 (store (select .cse9 .cse2) .cse8 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) .cse8 v_ArrVal_6399)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse6 .cse5) .cse0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse2 v_ArrVal_6400) .cse3) (+ 8 (select (select .cse4 .cse5) .cse0)))) (= .cse3 .cse5)))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse18 .cse11 (store (select .cse18 .cse11) .cse17 v_ArrVal_6397)))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse12 (store .cse16 .cse11 (store (select .cse16 .cse11) .cse17 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select .cse15 .cse13) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse11 v_ArrVal_6400) (select (select .cse12 .cse13) .cse10)) (+ 8 .cse14))) (= .cse10 .cse14)))))))))))))) is different from false [2023-02-14 13:53:44,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse21))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ (select (select .cse5 .cse6) .cse7) 8))) (= .cse6 .cse4)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse15 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select .cse17 .cse16) .cse12))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) (select (select .cse15 .cse16) .cse12)) (+ .cse13 8)))))))) (not (<= 0 .cse12)))))))))))) is different from false [2023-02-14 13:53:44,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse21) .cse22))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse11 .cse3 (store (select .cse11 .cse3) .cse10 v_ArrVal_6397)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse10 v_ArrVal_6399)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse8 .cse6) .cse7))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse3 v_ArrVal_6400) .cse4) (+ 8 (select (select .cse5 .cse6) .cse7))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse4 .cse6)))))) (not (<= 0 .cse7)))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6394))) (let ((.cse12 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse17 (store .cse20 .cse12 (store (select .cse20 .cse12) .cse19 v_ArrVal_6397)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse13 (store .cse18 .cse12 (store (select .cse18 .cse12) .cse19 v_ArrVal_6399)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse17 .cse14) .cse15))) (or (= (select (select (store (store (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6393) .cse12 v_ArrVal_6400) (select (select .cse13 .cse14) .cse15)) (+ 8 .cse16)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse15 .cse16)))))) (not (<= 0 .cse15)))))))))))) is different from false [2023-02-14 13:53:44,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse21) .cse22))) (let ((.cse3 (select |c_#memory_int| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse21) .cse22))) (and (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse11 .cse5 (store (select .cse11 .cse5) .cse10 v_ArrVal_6397)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse6 (store .cse9 .cse5 (store (select .cse9 .cse5) .cse10 v_ArrVal_6399)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse8 .cse7) .cse0))) (or (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse5 v_ArrVal_6400) (select (select .cse6 .cse7) .cse0)) (+ .cse1 8)))))))))))))) (forall ((v_ArrVal_6386 (Array Int Int)) (v_ArrVal_6387 (Array Int Int)) (v_ArrVal_6388 Int) (v_ArrVal_6393 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6397 Int) (v_ArrVal_6394 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6387) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6395)) (.cse18 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6386) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6394))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse15 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse19 v_ArrVal_6397)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (v_ArrVal_6399 Int)) (let ((.cse17 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse19 v_ArrVal_6399)))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse17 .cse13) .cse16))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse2 (store .cse3 .cse4 v_ArrVal_6388)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6393) .cse14 v_ArrVal_6400) .cse12) (+ (select (select .cse15 .cse13) .cse16) 8)))))))) (not (<= 0 .cse16)))))))))))) is different from false [2023-02-14 13:53:45,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113989305] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:45,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:53:45,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 81 [2023-02-14 13:53:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950398038] [2023-02-14 13:53:45,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:45,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-14 13:53:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:45,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-14 13:53:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=7669, Unknown=18, NotChecked=1086, Total=9120 [2023-02-14 13:53:45,251 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 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-14 13:53:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:56,750 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2023-02-14 13:53:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-14 13:53:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 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 67 [2023-02-14 13:53:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:56,751 INFO L225 Difference]: With dead ends: 125 [2023-02-14 13:53:56,751 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 13:53:56,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=954, Invalid=13813, Unknown=19, NotChecked=1470, Total=16256 [2023-02-14 13:53:56,753 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 515 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:56,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1497 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3539 Invalid, 3 Unknown, 0 Unchecked, 2.5s Time] [2023-02-14 13:53:56,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 13:53:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2023-02-14 13:53:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 99 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 13:53:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2023-02-14 13:53:56,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 67 [2023-02-14 13:53:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:56,755 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2023-02-14 13:53:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 72 states have internal predecessors, (120), 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-14 13:53:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2023-02-14 13:53:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-14 13:53:56,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:56,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:56,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-14 13:53:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-14 13:53:56,961 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-14 13:53:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -925225159, now seen corresponding path program 2 times [2023-02-14 13:53:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:56,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19137359] [2023-02-14 13:53:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:54:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 13:54:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-14 13:54:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19137359] [2023-02-14 13:54:02,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19137359] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952974230] [2023-02-14 13:54:02,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:54:02,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:02,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:02,960 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:54:02,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-14 13:54:03,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:54:03,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:54:03,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 215 conjunts are in the unsatisfiable core [2023-02-14 13:54:03,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:03,457 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-14 13:54:03,461 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-14 13:54:03,520 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-14 13:54:03,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-14 13:54:03,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:03,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:54:03,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:03,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 13:54:03,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:03,963 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-14 13:54:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:03,966 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-14 13:54:04,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:04,163 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-14 13:54:04,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-14 13:54:04,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:04,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 22 [2023-02-14 13:54:04,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:54:04,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:54:04,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 13:54:04,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:04,912 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:54:04,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 47 [2023-02-14 13:54:05,285 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-14 13:54:05,286 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 101 treesize of output 39 [2023-02-14 13:54:05,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-14 13:54:05,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,295 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-14 13:54:05,311 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-14 13:54:05,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,934 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 13:54:05,935 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 109 treesize of output 81 [2023-02-14 13:54:05,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,949 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 13:54:05,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2023-02-14 13:54:05,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:05,988 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 13:54:05,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2023-02-14 13:54:06,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:06,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 13:54:07,068 INFO L321 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2023-02-14 13:54:07,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 151 treesize of output 125 [2023-02-14 13:54:07,112 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-14 13:54:07,113 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2023-02-14 13:54:07,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:08,064 INFO L321 Elim1Store]: treesize reduction 132, result has 53.4 percent of original size [2023-02-14 13:54:08,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 609 treesize of output 565 [2023-02-14 13:54:08,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:08,188 INFO L321 Elim1Store]: treesize reduction 102, result has 50.2 percent of original size [2023-02-14 13:54:08,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 434 treesize of output 498 [2023-02-14 13:54:17,251 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 13 treesize of output 3 [2023-02-14 13:54:17,324 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 13 treesize of output 3 [2023-02-14 13:54:19,774 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 13 treesize of output 3 [2023-02-14 13:54:22,973 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 13 treesize of output 3 [2023-02-14 13:54:23,658 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 13 treesize of output 3 [2023-02-14 13:54:23,771 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 13 treesize of output 3 [2023-02-14 13:54:23,929 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:54:29,928 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 13 treesize of output 3 [2023-02-14 13:54:31,191 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:54:32,793 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:54:36,584 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:54:37,112 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 13:54:37,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 26 [2023-02-14 13:54:43,829 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 441 treesize of output 421 [2023-02-14 13:54:43,947 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 1213 treesize of output 1043 [2023-02-14 13:54:44,218 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 616 treesize of output 580 [2023-02-14 13:54:44,418 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2023-02-14 13:54:44,444 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 66 treesize of output 50 [2023-02-14 13:54:44,470 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 607 treesize of output 561 [2023-02-14 13:54:44,605 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 12 treesize of output 8 [2023-02-14 13:54:44,639 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 214 treesize of output 182 [2023-02-14 13:54:44,712 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 16 treesize of output 12 [2023-02-14 13:54:44,748 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 35 treesize of output 29 [2023-02-14 13:54:54,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:54,615 INFO L321 Elim1Store]: treesize reduction 495, result has 23.7 percent of original size [2023-02-14 13:54:54,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 63 case distinctions, treesize of input 1525 treesize of output 1162 [2023-02-14 13:54:54,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:54,842 INFO L321 Elim1Store]: treesize reduction 306, result has 28.3 percent of original size [2023-02-14 13:54:54,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 1106 treesize of output 998 [2023-02-14 13:55:09,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:55:10,127 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 12 treesize of output 11 [2023-02-14 13:55:10,528 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 12 treesize of output 11 [2023-02-14 13:55:10,781 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 12 treesize of output 11 [2023-02-14 13:55:10,974 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 12 treesize of output 11 [2023-02-14 13:55:11,273 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 12 treesize of output 11 [2023-02-14 13:55:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:13,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-02-14 13:55:13,797 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 12 treesize of output 11 [2023-02-14 13:55:14,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:14,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-02-14 13:55:14,738 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 12 treesize of output 11 [2023-02-14 13:55:15,523 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 12 treesize of output 11 [2023-02-14 13:55:16,039 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:55:16,681 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 12 treesize of output 11 [2023-02-14 13:55:18,712 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 12 treesize of output 11 [2023-02-14 13:55:19,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-14 13:55:19,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-14 13:55:20,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-14 13:55:23,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-14 13:55:24,403 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:55:26,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11