./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:15:52,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:15:52,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:15:52,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:15:52,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:15:52,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:15:52,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:15:52,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:15:52,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:15:52,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:15:52,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:15:52,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:15:52,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:15:52,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:15:52,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:15:52,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:15:52,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:15:52,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:15:52,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:15:52,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:15:52,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:15:52,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:15:52,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:15:52,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:15:52,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:15:52,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:15:52,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:15:52,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:15:52,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:15:52,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:15:52,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:15:52,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:15:52,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:15:52,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:15:52,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:15:52,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:15:52,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:15:52,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:15:52,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:15:52,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:15:52,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:15:52,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 17:15:52,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:15:52,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:15:52,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:15:52,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:15:52,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:15:52,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:15:52,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:15:52,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:15:52,179 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:15:52,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:15:52,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:15:52,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:15:52,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:15:52,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:15:52,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:15:52,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:15:52,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:15:52,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:15:52,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:15:52,181 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:15:52,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:15:52,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:15:52,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:15:52,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:15:52,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:15:52,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:15:52,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:15:52,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:15:52,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:15:52,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:15:52,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a 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 [2022-11-21 17:15:52,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:15:52,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:15:52,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:15:52,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:15:52,449 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:15:52,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-21 17:15:55,595 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:15:55,852 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:15:55,853 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-21 17:15:55,876 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/data/4ed420e21/56538f1ad1a34788b6c05327ff34d7af/FLAG09b19f422 [2022-11-21 17:15:55,896 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/data/4ed420e21/56538f1ad1a34788b6c05327ff34d7af [2022-11-21 17:15:55,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:15:55,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:15:55,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:15:55,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:15:55,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:15:55,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:15:55" (1/1) ... [2022-11-21 17:15:55,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f64bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:55, skipping insertion in model container [2022-11-21 17:15:55,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:15:55" (1/1) ... [2022-11-21 17:15:55,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:15:55,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:15:56,323 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-21 17:15:56,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:15:56,342 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:15:56,415 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-21 17:15:56,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:15:56,443 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:15:56,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56 WrapperNode [2022-11-21 17:15:56,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:15:56,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:15:56,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:15:56,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:15:56,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,493 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-11-21 17:15:56,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:15:56,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:15:56,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:15:56,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:15:56,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,542 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:15:56,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:15:56,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:15:56,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:15:56,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (1/1) ... [2022-11-21 17:15:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:15:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:15:56,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:15:56,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:15:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:15:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:15:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 17:15:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 17:15:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:15:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:15:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:15:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:15:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:15:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:15:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 17:15:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:15:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:15:56,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:15:56,852 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:15:56,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:15:57,365 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:15:57,372 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:15:57,373 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 17:15:57,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:15:57 BoogieIcfgContainer [2022-11-21 17:15:57,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:15:57,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:15:57,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:15:57,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:15:57,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:15:55" (1/3) ... [2022-11-21 17:15:57,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1288067e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:15:57, skipping insertion in model container [2022-11-21 17:15:57,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:56" (2/3) ... [2022-11-21 17:15:57,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1288067e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:15:57, skipping insertion in model container [2022-11-21 17:15:57,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:15:57" (3/3) ... [2022-11-21 17:15:57,385 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2022-11-21 17:15:57,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:15:57,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-11-21 17:15:57,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:15:57,461 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=FINITE_AUTOMATA, 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;@546453a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:15:57,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-11-21 17:15:57,466 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) [2022-11-21 17:15:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 17:15:57,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:15:57,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:15:57,474 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)] === [2022-11-21 17:15:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2022-11-21 17:15:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:57,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138118726] [2022-11-21 17:15:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:15:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:57,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138118726] [2022-11-21 17:15:57,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138118726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:57,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:57,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664992127] [2022-11-21 17:15:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:57,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:57,822 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) [2022-11-21 17:15:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:15:57,969 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2022-11-21 17:15:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:57,972 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 [2022-11-21 17:15:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:15:57,980 INFO L225 Difference]: With dead ends: 128 [2022-11-21 17:15:57,980 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 17:15:57,982 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 [2022-11-21 17:15:57,986 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 [2022-11-21 17:15:57,987 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] [2022-11-21 17:15:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 17:15:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-21 17:15:58,027 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) [2022-11-21 17:15:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-11-21 17:15:58,030 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2022-11-21 17:15:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:15:58,031 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-11-21 17:15:58,031 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) [2022-11-21 17:15:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-11-21 17:15:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 17:15:58,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:15:58,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:15:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:15:58,033 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)] === [2022-11-21 17:15:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2022-11-21 17:15:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174100658] [2022-11-21 17:15:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:15:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:58,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174100658] [2022-11-21 17:15:58,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174100658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:58,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:58,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677071825] [2022-11-21 17:15:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:58,185 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) [2022-11-21 17:15:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:15:58,359 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-11-21 17:15:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:58,360 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 [2022-11-21 17:15:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:15:58,361 INFO L225 Difference]: With dead ends: 122 [2022-11-21 17:15:58,362 INFO L226 Difference]: Without dead ends: 122 [2022-11-21 17:15:58,362 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 [2022-11-21 17:15:58,363 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:15:58,364 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] [2022-11-21 17:15:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-21 17:15:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-21 17:15:58,372 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) [2022-11-21 17:15:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-21 17:15:58,374 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2022-11-21 17:15:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:15:58,374 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-21 17:15:58,375 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) [2022-11-21 17:15:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-21 17:15:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:15:58,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:15:58,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:15:58,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:15:58,376 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)] === [2022-11-21 17:15:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2022-11-21 17:15:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276289635] [2022-11-21 17:15:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:15:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:15:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:58,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276289635] [2022-11-21 17:15:58,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276289635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:58,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:15:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679532575] [2022-11-21 17:15:58,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:58,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:15:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:15:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:15:58,570 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:15:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:15:58,753 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-21 17:15:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:15:58,755 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 [2022-11-21 17:15:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:15:58,760 INFO L225 Difference]: With dead ends: 133 [2022-11-21 17:15:58,760 INFO L226 Difference]: Without dead ends: 133 [2022-11-21 17:15:58,762 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 [2022-11-21 17:15:58,763 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 [2022-11-21 17:15:58,764 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] [2022-11-21 17:15:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-21 17:15:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2022-11-21 17:15:58,772 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) [2022-11-21 17:15:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-11-21 17:15:58,774 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2022-11-21 17:15:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:15:58,774 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-11-21 17:15:58,774 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) [2022-11-21 17:15:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-11-21 17:15:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 17:15:58,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:15:58,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:15:58,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:15:58,776 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)] === [2022-11-21 17:15:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2022-11-21 17:15:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839092972] [2022-11-21 17:15:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:15:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:15:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:15:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839092972] [2022-11-21 17:15:59,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839092972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:59,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:59,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:15:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724653351] [2022-11-21 17:15:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:15:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:15:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:15:59,065 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) [2022-11-21 17:15:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:15:59,378 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-11-21 17:15:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:15:59,378 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 [2022-11-21 17:15:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:15:59,381 INFO L225 Difference]: With dead ends: 123 [2022-11-21 17:15:59,381 INFO L226 Difference]: Without dead ends: 123 [2022-11-21 17:15:59,381 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 [2022-11-21 17:15:59,383 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:15:59,383 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.3s Time] [2022-11-21 17:15:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-21 17:15:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-11-21 17:15:59,389 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) [2022-11-21 17:15:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-21 17:15:59,391 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2022-11-21 17:15:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:15:59,392 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-21 17:15:59,392 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) [2022-11-21 17:15:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-21 17:15:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 17:15:59,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:15:59,393 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:15:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:15:59,394 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)] === [2022-11-21 17:15:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2022-11-21 17:15:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:59,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250067588] [2022-11-21 17:15:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:15:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:15:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:15:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250067588] [2022-11-21 17:15:59,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250067588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:59,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:59,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:15:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953468304] [2022-11-21 17:15:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:15:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:15:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:15:59,825 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) [2022-11-21 17:16:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:00,147 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-11-21 17:16:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:00,148 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 [2022-11-21 17:16:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:00,149 INFO L225 Difference]: With dead ends: 122 [2022-11-21 17:16:00,149 INFO L226 Difference]: Without dead ends: 122 [2022-11-21 17:16:00,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:16:00,150 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:00,150 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.3s Time] [2022-11-21 17:16:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-21 17:16:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-11-21 17:16:00,155 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) [2022-11-21 17:16:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-11-21 17:16:00,156 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-11-21 17:16:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:00,157 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-11-21 17:16:00,157 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) [2022-11-21 17:16:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-11-21 17:16:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 17:16:00,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:00,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:16:00,158 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)] === [2022-11-21 17:16:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2022-11-21 17:16:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696524757] [2022-11-21 17:16:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:00,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696524757] [2022-11-21 17:16:00,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696524757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:00,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73331779] [2022-11-21 17:16:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:00,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:00,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:00,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:00,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:16:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:00,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 17:16:00,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:00,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:16:00,867 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 [2022-11-21 17:16:01,016 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:16:01,017 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 [2022-11-21 17:16:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 17:16:01,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:01,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73331779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:01,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:01,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-21 17:16:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511415861] [2022-11-21 17:16:01,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:01,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:16:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:01,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:16:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-21 17:16:01,112 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) [2022-11-21 17:16:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:01,557 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-21 17:16:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:01,558 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 [2022-11-21 17:16:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:01,559 INFO L225 Difference]: With dead ends: 146 [2022-11-21 17:16:01,559 INFO L226 Difference]: Without dead ends: 146 [2022-11-21 17:16:01,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-21 17:16:01,561 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 103 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:01,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 379 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 423 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2022-11-21 17:16:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-21 17:16:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-11-21 17:16:01,567 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) [2022-11-21 17:16:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-11-21 17:16:01,577 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2022-11-21 17:16:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:01,577 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-11-21 17:16:01,577 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) [2022-11-21 17:16:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-11-21 17:16:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 17:16:01,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:01,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:01,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:01,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 17:16:01,786 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)] === [2022-11-21 17:16:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2022-11-21 17:16:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468312210] [2022-11-21 17:16:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:02,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468312210] [2022-11-21 17:16:02,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468312210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:02,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854981803] [2022-11-21 17:16:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:02,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:02,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:16:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:02,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 17:16:02,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:02,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 [2022-11-21 17:16:02,804 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 [2022-11-21 17:16:02,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:02,878 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 [2022-11-21 17:16:02,885 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:16:02,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 11 treesize of output 11 [2022-11-21 17:16:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 17:16:02,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:07,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854981803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:07,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:07,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2022-11-21 17:16:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736385552] [2022-11-21 17:16:07,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:07,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 17:16:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 17:16:07,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2022-11-21 17:16:07,131 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) [2022-11-21 17:16:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:08,049 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-11-21 17:16:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:16:08,050 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 [2022-11-21 17:16:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:08,051 INFO L225 Difference]: With dead ends: 128 [2022-11-21 17:16:08,051 INFO L226 Difference]: Without dead ends: 128 [2022-11-21 17:16:08,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2022-11-21 17:16:08,052 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 20 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:08,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 739 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 778 Invalid, 0 Unknown, 122 Unchecked, 0.7s Time] [2022-11-21 17:16:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-21 17:16:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-21 17:16:08,064 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) [2022-11-21 17:16:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-11-21 17:16:08,065 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2022-11-21 17:16:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:08,066 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-11-21 17:16:08,066 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) [2022-11-21 17:16:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-11-21 17:16:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 17:16:08,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:08,067 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] [2022-11-21 17:16:08,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 17:16:08,284 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)] === [2022-11-21 17:16:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2022-11-21 17:16:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:08,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184524230] [2022-11-21 17:16:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:08,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184524230] [2022-11-21 17:16:08,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184524230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2437181] [2022-11-21 17:16:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:08,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:08,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:16:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:16:08,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:08,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:08,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2437181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:16:08,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:16:08,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-21 17:16:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359900864] [2022-11-21 17:16:08,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:16:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:16:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:16:08,804 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) [2022-11-21 17:16:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:09,017 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-21 17:16:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:09,017 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 [2022-11-21 17:16:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:09,018 INFO L225 Difference]: With dead ends: 127 [2022-11-21 17:16:09,018 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 17:16:09,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:16:09,019 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:09,020 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.2s Time] [2022-11-21 17:16:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 17:16:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-11-21 17:16:09,032 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) [2022-11-21 17:16:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2022-11-21 17:16:09,033 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2022-11-21 17:16:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:09,035 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2022-11-21 17:16:09,035 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) [2022-11-21 17:16:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2022-11-21 17:16:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 17:16:09,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:09,037 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] [2022-11-21 17:16:09,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:09,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:09,243 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)] === [2022-11-21 17:16:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2022-11-21 17:16:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:09,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686117783] [2022-11-21 17:16:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:16:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686117783] [2022-11-21 17:16:09,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686117783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:09,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196382332] [2022-11-21 17:16:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:09,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:09,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:09,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:09,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:16:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:09,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 17:16:09,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:16:09,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:09,585 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:16:09,586 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 [2022-11-21 17:16:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:16:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196382332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:16:09,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:16:09,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-21 17:16:09,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427264074] [2022-11-21 17:16:09,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:09,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:09,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:09,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:09,613 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) [2022-11-21 17:16:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:09,867 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-11-21 17:16:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:09,868 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 [2022-11-21 17:16:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:09,869 INFO L225 Difference]: With dead ends: 131 [2022-11-21 17:16:09,869 INFO L226 Difference]: Without dead ends: 131 [2022-11-21 17:16:09,869 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 [2022-11-21 17:16:09,870 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 12 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:09,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 403 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:16:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-21 17:16:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-11-21 17:16:09,874 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) [2022-11-21 17:16:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-11-21 17:16:09,875 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2022-11-21 17:16:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:09,875 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-11-21 17:16:09,875 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) [2022-11-21 17:16:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-11-21 17:16:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 17:16:09,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:09,876 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] [2022-11-21 17:16:09,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:10,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:10,083 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)] === [2022-11-21 17:16:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2022-11-21 17:16:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334672272] [2022-11-21 17:16:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:10,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334672272] [2022-11-21 17:16:10,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334672272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992744725] [2022-11-21 17:16:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:10,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:10,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:16:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:10,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 17:16:10,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:10,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:10,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:10,732 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 [2022-11-21 17:16:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:10,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992744725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:16:10,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:16:10,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-21 17:16:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050021137] [2022-11-21 17:16:10,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:10,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 17:16:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 17:16:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:16:10,909 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) [2022-11-21 17:16:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:11,304 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-11-21 17:16:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:16:11,305 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 [2022-11-21 17:16:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:11,306 INFO L225 Difference]: With dead ends: 136 [2022-11-21 17:16:11,306 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 17:16:11,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:16:11,307 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 23 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:11,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1057 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 17:16:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2022-11-21 17:16:11,311 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) [2022-11-21 17:16:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-11-21 17:16:11,311 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2022-11-21 17:16:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:11,312 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-11-21 17:16:11,312 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) [2022-11-21 17:16:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-11-21 17:16:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:16:11,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:11,313 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] [2022-11-21 17:16:11,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:11,532 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)] === [2022-11-21 17:16:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2022-11-21 17:16:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082895419] [2022-11-21 17:16:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:11,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082895419] [2022-11-21 17:16:11,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082895419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:11,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:11,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:16:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630359038] [2022-11-21 17:16:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:16:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:16:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:16:11,712 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) [2022-11-21 17:16:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:12,069 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-21 17:16:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:16:12,070 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 [2022-11-21 17:16:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:12,071 INFO L225 Difference]: With dead ends: 129 [2022-11-21 17:16:12,071 INFO L226 Difference]: Without dead ends: 129 [2022-11-21 17:16:12,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:16:12,072 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:12,072 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.3s Time] [2022-11-21 17:16:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-21 17:16:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-21 17:16:12,075 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) [2022-11-21 17:16:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-11-21 17:16:12,076 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2022-11-21 17:16:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:12,077 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-11-21 17:16:12,077 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) [2022-11-21 17:16:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-11-21 17:16:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:16:12,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:12,078 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] [2022-11-21 17:16:12,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:16:12,078 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)] === [2022-11-21 17:16:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2022-11-21 17:16:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:12,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238165399] [2022-11-21 17:16:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:12,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:12,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238165399] [2022-11-21 17:16:12,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238165399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:12,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:12,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:16:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733042221] [2022-11-21 17:16:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:12,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:16:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:16:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:16:12,395 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) [2022-11-21 17:16:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:12,739 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-21 17:16:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:16:12,740 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 [2022-11-21 17:16:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:12,741 INFO L225 Difference]: With dead ends: 127 [2022-11-21 17:16:12,741 INFO L226 Difference]: Without dead ends: 127 [2022-11-21 17:16:12,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:16:12,742 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:12,742 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.3s Time] [2022-11-21 17:16:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-21 17:16:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-21 17:16:12,745 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) [2022-11-21 17:16:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-21 17:16:12,745 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-11-21 17:16:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:12,746 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-21 17:16:12,746 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) [2022-11-21 17:16:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-21 17:16:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:16:12,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:12,747 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] [2022-11-21 17:16:12,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:16:12,747 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)] === [2022-11-21 17:16:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2022-11-21 17:16:12,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:12,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606800106] [2022-11-21 17:16:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 17:16:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 17:16:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606800106] [2022-11-21 17:16:12,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606800106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:12,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879800787] [2022-11-21 17:16:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:12,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:12,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:12,907 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:12,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:16:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:16:13,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:16:13,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:16:13,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879800787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:13,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:16:13,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 17:16:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235960265] [2022-11-21 17:16:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:13,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:16:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:16:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:13,170 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) [2022-11-21 17:16:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:13,186 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-11-21 17:16:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:16:13,187 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 [2022-11-21 17:16:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:13,187 INFO L225 Difference]: With dead ends: 115 [2022-11-21 17:16:13,188 INFO L226 Difference]: Without dead ends: 115 [2022-11-21 17:16:13,188 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 [2022-11-21 17:16:13,189 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 198 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:13,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:16:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-21 17:16:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-21 17:16:13,192 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) [2022-11-21 17:16:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-11-21 17:16:13,193 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2022-11-21 17:16:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:13,193 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-11-21 17:16:13,193 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) [2022-11-21 17:16:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-11-21 17:16:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 17:16:13,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:13,194 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] [2022-11-21 17:16:13,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:13,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:13,407 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)] === [2022-11-21 17:16:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2022-11-21 17:16:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:13,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436788554] [2022-11-21 17:16:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:16:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436788554] [2022-11-21 17:16:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436788554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222881155] [2022-11-21 17:16:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:13,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:13,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:16:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 17:16:14,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:14,210 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 [2022-11-21 17:16:14,220 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 [2022-11-21 17:16:14,242 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 [2022-11-21 17:16:14,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:14,287 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 [2022-11-21 17:16:14,300 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 [2022-11-21 17:16:14,323 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:16:14,323 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 [2022-11-21 17:16:14,373 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:16:14,374 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 [2022-11-21 17:16:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2022-11-21 17:16:14,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:14,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222881155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:14,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:14,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2022-11-21 17:16:14,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712019260] [2022-11-21 17:16:14,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:14,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 17:16:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 17:16:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2022-11-21 17:16:14,707 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) [2022-11-21 17:16:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:15,103 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2022-11-21 17:16:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:15,104 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 [2022-11-21 17:16:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:15,105 INFO L225 Difference]: With dead ends: 125 [2022-11-21 17:16:15,105 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 17:16:15,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2022-11-21 17:16:15,106 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 268 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:15,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 266 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 348 Invalid, 0 Unknown, 250 Unchecked, 0.3s Time] [2022-11-21 17:16:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 17:16:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-21 17:16:15,109 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) [2022-11-21 17:16:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-11-21 17:16:15,110 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2022-11-21 17:16:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:15,110 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-11-21 17:16:15,111 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) [2022-11-21 17:16:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-11-21 17:16:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 17:16:15,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:15,112 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] [2022-11-21 17:16:15,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:15,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 17:16:15,318 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)] === [2022-11-21 17:16:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2022-11-21 17:16:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042426954] [2022-11-21 17:16:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:16:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042426954] [2022-11-21 17:16:16,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042426954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366632910] [2022-11-21 17:16:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:16,108 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:16,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:16:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:16,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 17:16:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:16,362 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 [2022-11-21 17:16:16,377 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 [2022-11-21 17:16:16,398 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 [2022-11-21 17:16:16,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:16,488 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 [2022-11-21 17:16:16,511 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 [2022-11-21 17:16:16,519 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 [2022-11-21 17:16:16,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:16,565 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 [2022-11-21 17:16:16,640 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 [2022-11-21 17:16:16,648 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 [2022-11-21 17:16:16,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:16,694 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 [2022-11-21 17:16:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-21 17:16:16,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:18,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366632910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:18,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:18,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-21 17:16:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971618050] [2022-11-21 17:16:18,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:18,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:16:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:16:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-11-21 17:16:18,825 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) [2022-11-21 17:16:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:19,190 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-21 17:16:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:16:19,191 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 [2022-11-21 17:16:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:19,192 INFO L225 Difference]: With dead ends: 117 [2022-11-21 17:16:19,192 INFO L226 Difference]: Without dead ends: 117 [2022-11-21 17:16:19,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-11-21 17:16:19,193 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 211 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:19,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 104 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 210 Invalid, 0 Unknown, 351 Unchecked, 0.3s Time] [2022-11-21 17:16:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-21 17:16:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-21 17:16:19,195 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) [2022-11-21 17:16:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-11-21 17:16:19,196 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2022-11-21 17:16:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:19,196 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-11-21 17:16:19,196 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) [2022-11-21 17:16:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-11-21 17:16:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:16:19,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:19,197 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] [2022-11-21 17:16:19,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:19,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 17:16:19,397 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)] === [2022-11-21 17:16:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2022-11-21 17:16:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:19,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762643635] [2022-11-21 17:16:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:16:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762643635] [2022-11-21 17:16:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762643635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:19,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:19,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:16:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114683021] [2022-11-21 17:16:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:16:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:16:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:16:19,564 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) [2022-11-21 17:16:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:19,796 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-11-21 17:16:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:19,796 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 [2022-11-21 17:16:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:19,797 INFO L225 Difference]: With dead ends: 113 [2022-11-21 17:16:19,797 INFO L226 Difference]: Without dead ends: 113 [2022-11-21 17:16:19,797 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 [2022-11-21 17:16:19,798 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:19,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:16:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-21 17:16:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2022-11-21 17:16:19,801 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) [2022-11-21 17:16:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-21 17:16:19,801 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2022-11-21 17:16:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:19,802 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-21 17:16:19,802 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) [2022-11-21 17:16:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-21 17:16:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:16:19,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:19,803 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] [2022-11-21 17:16:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 17:16:19,803 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)] === [2022-11-21 17:16:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2022-11-21 17:16:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:19,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304879898] [2022-11-21 17:16:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 17:16:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:20,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304879898] [2022-11-21 17:16:20,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304879898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:20,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:20,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:16:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476201466] [2022-11-21 17:16:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:20,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:16:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:16:20,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:16:20,229 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) [2022-11-21 17:16:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:20,456 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-21 17:16:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:20,456 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 [2022-11-21 17:16:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:20,457 INFO L225 Difference]: With dead ends: 91 [2022-11-21 17:16:20,457 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 17:16:20,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:16:20,458 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:20,458 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.2s Time] [2022-11-21 17:16:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 17:16:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-21 17:16:20,460 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) [2022-11-21 17:16:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-21 17:16:20,461 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2022-11-21 17:16:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:20,461 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-21 17:16:20,461 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) [2022-11-21 17:16:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-21 17:16:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:16:20,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:20,462 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] [2022-11-21 17:16:20,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 17:16:20,462 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)] === [2022-11-21 17:16:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2022-11-21 17:16:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:20,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504249629] [2022-11-21 17:16:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:16:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504249629] [2022-11-21 17:16:21,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504249629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:21,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842426737] [2022-11-21 17:16:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:21,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:21,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:16:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:21,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 17:16:21,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:21,668 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 [2022-11-21 17:16:21,912 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 [2022-11-21 17:16:22,082 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 [2022-11-21 17:16:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:22,120 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 [2022-11-21 17:16:22,142 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-21 17:16:22,143 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 [2022-11-21 17:16:22,195 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 [2022-11-21 17:16:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 17:16:22,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842426737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:22,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-11-21 17:16:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610969364] [2022-11-21 17:16:22,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 17:16:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 17:16:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2022-11-21 17:16:22,318 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) [2022-11-21 17:16:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:23,236 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-21 17:16:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:16:23,237 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 [2022-11-21 17:16:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:23,238 INFO L225 Difference]: With dead ends: 108 [2022-11-21 17:16:23,238 INFO L226 Difference]: Without dead ends: 108 [2022-11-21 17:16:23,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=842, Unknown=1, NotChecked=60, Total=1056 [2022-11-21 17:16:23,239 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 457 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:23,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 455 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 663 Invalid, 0 Unknown, 93 Unchecked, 0.7s Time] [2022-11-21 17:16:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-21 17:16:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-11-21 17:16:23,241 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) [2022-11-21 17:16:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-21 17:16:23,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2022-11-21 17:16:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:23,242 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-21 17:16:23,242 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) [2022-11-21 17:16:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-21 17:16:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:16:23,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:23,244 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] [2022-11-21 17:16:23,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:23,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:16:23,447 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)] === [2022-11-21 17:16:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2022-11-21 17:16:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:23,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104381084] [2022-11-21 17:16:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:25,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104381084] [2022-11-21 17:16:25,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104381084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:25,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207023989] [2022-11-21 17:16:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:25,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:25,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:25,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:16:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:25,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 17:16:25,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:25,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:16:25,989 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 [2022-11-21 17:16:25,995 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 [2022-11-21 17:16:26,287 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 [2022-11-21 17:16:26,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:26,369 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 [2022-11-21 17:16:26,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:26,379 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 [2022-11-21 17:16:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:26,387 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 [2022-11-21 17:16:26,401 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:16:26,402 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 [2022-11-21 17:16:26,490 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 [2022-11-21 17:16:26,494 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 [2022-11-21 17:16:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 17:16:26,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207023989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:27,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:27,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2022-11-21 17:16:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98732736] [2022-11-21 17:16:27,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:27,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 17:16:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 17:16:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1024, Unknown=2, NotChecked=64, Total=1190 [2022-11-21 17:16:27,699 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) [2022-11-21 17:16:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:29,987 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-21 17:16:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:16:29,988 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 [2022-11-21 17:16:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:29,988 INFO L225 Difference]: With dead ends: 89 [2022-11-21 17:16:29,989 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 17:16:29,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=228, Invalid=1841, Unknown=5, NotChecked=88, Total=2162 [2022-11-21 17:16:29,990 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 328 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 892 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1234 Invalid, 3 Unknown, 92 Unchecked, 1.3s Time] [2022-11-21 17:16:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 17:16:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-21 17:16:29,993 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) [2022-11-21 17:16:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-21 17:16:29,994 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2022-11-21 17:16:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:29,994 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-21 17:16:29,994 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) [2022-11-21 17:16:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-21 17:16:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:16:29,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:29,995 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] [2022-11-21 17:16:30,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:30,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:30,199 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)] === [2022-11-21 17:16:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2022-11-21 17:16:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:30,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924870048] [2022-11-21 17:16:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:32,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924870048] [2022-11-21 17:16:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924870048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863343104] [2022-11-21 17:16:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:32,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:32,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:16:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:32,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-21 17:16:32,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:32,718 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 [2022-11-21 17:16:33,104 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 [2022-11-21 17:16:33,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:33,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:33,315 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 [2022-11-21 17:16:33,321 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 [2022-11-21 17:16:33,576 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 [2022-11-21 17:16:33,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:33,642 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:16:33,643 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 [2022-11-21 17:16:33,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:33,651 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 [2022-11-21 17:16:33,691 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-21 17:16:33,691 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 [2022-11-21 17:16:33,796 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 [2022-11-21 17:16:33,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:33,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:33,878 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 [2022-11-21 17:16:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 17:16:33,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:34,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863343104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:34,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:34,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2022-11-21 17:16:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018849416] [2022-11-21 17:16:34,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:34,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 17:16:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 17:16:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1144, Unknown=1, NotChecked=68, Total=1332 [2022-11-21 17:16:34,195 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) [2022-11-21 17:16:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:36,752 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-11-21 17:16:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 17:16:36,753 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 [2022-11-21 17:16:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:36,754 INFO L225 Difference]: With dead ends: 147 [2022-11-21 17:16:36,754 INFO L226 Difference]: Without dead ends: 147 [2022-11-21 17:16:36,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=320, Invalid=2233, Unknown=1, NotChecked=98, Total=2652 [2022-11-21 17:16:36,755 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 491 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:36,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1085 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1290 Invalid, 0 Unknown, 136 Unchecked, 1.3s Time] [2022-11-21 17:16:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-21 17:16:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2022-11-21 17:16:36,759 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) [2022-11-21 17:16:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-21 17:16:36,759 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2022-11-21 17:16:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:36,760 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-21 17:16:36,760 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) [2022-11-21 17:16:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-21 17:16:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:16:36,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:36,761 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] [2022-11-21 17:16:36,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:36,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:36,968 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)] === [2022-11-21 17:16:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2022-11-21 17:16:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:36,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675251530] [2022-11-21 17:16:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675251530] [2022-11-21 17:16:40,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675251530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198034241] [2022-11-21 17:16:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:40,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:40,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:40,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:16:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:40,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-21 17:16:40,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:40,711 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 [2022-11-21 17:16:41,254 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 [2022-11-21 17:16:41,262 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 [2022-11-21 17:16:41,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:41,542 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 [2022-11-21 17:16:41,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:41,557 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 [2022-11-21 17:16:41,912 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 [2022-11-21 17:16:41,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:41,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:41,968 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:16:41,969 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 [2022-11-21 17:16:41,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:41,980 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 [2022-11-21 17:16:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:41,995 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:16:41,996 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 [2022-11-21 17:16:42,017 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-11-21 17:16:42,017 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 [2022-11-21 17:16:42,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:16:42,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:16:42,220 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 [2022-11-21 17:16:42,230 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-21 17:16:42,231 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 [2022-11-21 17:16:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 17:16:42,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:42,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198034241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:42,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:42,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2022-11-21 17:16:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515679134] [2022-11-21 17:16:42,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:42,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-21 17:16:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 17:16:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2022-11-21 17:16:42,889 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) [2022-11-21 17:16:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:47,098 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-11-21 17:16:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:16:47,098 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 [2022-11-21 17:16:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:47,099 INFO L225 Difference]: With dead ends: 130 [2022-11-21 17:16:47,100 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 17:16:47,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=346, Invalid=3946, Unknown=2, NotChecked=128, Total=4422 [2022-11-21 17:16:47,102 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 243 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:47,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1913 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2398 Invalid, 2 Unknown, 90 Unchecked, 2.4s Time] [2022-11-21 17:16:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 17:16:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2022-11-21 17:16:47,105 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) [2022-11-21 17:16:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-21 17:16:47,105 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2022-11-21 17:16:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:47,106 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-21 17:16:47,106 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) [2022-11-21 17:16:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-21 17:16:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:16:47,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:47,107 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] [2022-11-21 17:16:47,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-21 17:16:47,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:47,314 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)] === [2022-11-21 17:16:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2022-11-21 17:16:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875669917] [2022-11-21 17:16:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:16:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:47,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875669917] [2022-11-21 17:16:47,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875669917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:47,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:47,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 17:16:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285344047] [2022-11-21 17:16:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:47,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:16:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:16:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:16:47,665 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) [2022-11-21 17:16:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:48,028 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-11-21 17:16:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 17:16:48,031 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 [2022-11-21 17:16:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:48,032 INFO L225 Difference]: With dead ends: 150 [2022-11-21 17:16:48,032 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 17:16:48,032 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 [2022-11-21 17:16:48,033 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 269 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:48,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 380 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 17:16:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2022-11-21 17:16:48,038 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) [2022-11-21 17:16:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-21 17:16:48,039 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2022-11-21 17:16:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:48,040 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-21 17:16:48,040 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) [2022-11-21 17:16:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-21 17:16:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:16:48,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:48,042 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] [2022-11-21 17:16:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 17:16:48,042 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)] === [2022-11-21 17:16:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2022-11-21 17:16:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201353771] [2022-11-21 17:16:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 17:16:48,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:48,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201353771] [2022-11-21 17:16:48,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201353771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:48,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:48,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:16:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857631113] [2022-11-21 17:16:48,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 17:16:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 17:16:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:16:48,623 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) [2022-11-21 17:16:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:48,983 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-11-21 17:16:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:16:48,983 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 [2022-11-21 17:16:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:48,984 INFO L225 Difference]: With dead ends: 132 [2022-11-21 17:16:48,984 INFO L226 Difference]: Without dead ends: 132 [2022-11-21 17:16:48,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:16:48,985 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 280 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:48,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 405 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-21 17:16:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-11-21 17:16:48,988 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) [2022-11-21 17:16:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-11-21 17:16:48,988 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2022-11-21 17:16:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:48,988 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-11-21 17:16:48,988 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) [2022-11-21 17:16:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-11-21 17:16:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 17:16:48,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:48,989 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] [2022-11-21 17:16:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 17:16:48,989 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)] === [2022-11-21 17:16:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2022-11-21 17:16:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:48,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73203734] [2022-11-21 17:16:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:49,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73203734] [2022-11-21 17:16:49,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73203734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:49,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143752745] [2022-11-21 17:16:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:49,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:49,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:49,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:49,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:16:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:49,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-21 17:16:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:50,327 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 [2022-11-21 17:16:50,426 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 [2022-11-21 17:16:50,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:50,453 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 [2022-11-21 17:16:50,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 25 treesize of output 13 [2022-11-21 17:16:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 17:16:50,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:50,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143752745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:50,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:16:50,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-21 17:16:50,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317629382] [2022-11-21 17:16:50,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 17:16:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:50,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 17:16:50,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=610, Unknown=9, NotChecked=50, Total=756 [2022-11-21 17:16:50,696 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) [2022-11-21 17:16:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:51,400 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-21 17:16:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:16:51,400 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 [2022-11-21 17:16:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:51,401 INFO L225 Difference]: With dead ends: 83 [2022-11-21 17:16:51,401 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 17:16:51,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=952, Unknown=9, NotChecked=64, Total=1190 [2022-11-21 17:16:51,403 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 405 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:51,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 677 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 476 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2022-11-21 17:16:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 17:16:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-21 17:16:51,405 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) [2022-11-21 17:16:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-21 17:16:51,406 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2022-11-21 17:16:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:51,406 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-21 17:16:51,407 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) [2022-11-21 17:16:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-21 17:16:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 17:16:51,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:51,407 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] [2022-11-21 17:16:51,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:51,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 17:16:51,615 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)] === [2022-11-21 17:16:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2022-11-21 17:16:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:51,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528555479] [2022-11-21 17:16:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 17:16:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528555479] [2022-11-21 17:16:52,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528555479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:52,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:52,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-21 17:16:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166490965] [2022-11-21 17:16:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:16:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:16:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:16:52,837 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) [2022-11-21 17:16:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:53,331 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-21 17:16:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:16:53,332 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 [2022-11-21 17:16:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:53,333 INFO L225 Difference]: With dead ends: 100 [2022-11-21 17:16:53,333 INFO L226 Difference]: Without dead ends: 100 [2022-11-21 17:16:53,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2022-11-21 17:16:53,334 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 316 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:53,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 416 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-21 17:16:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-11-21 17:16:53,336 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) [2022-11-21 17:16:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-21 17:16:53,337 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2022-11-21 17:16:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:53,338 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-21 17:16:53,338 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) [2022-11-21 17:16:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-21 17:16:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 17:16:53,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:53,339 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] [2022-11-21 17:16:53,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 17:16:53,339 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)] === [2022-11-21 17:16:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2022-11-21 17:16:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188185711] [2022-11-21 17:16:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:16:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:16:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:16:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:16:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:55,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188185711] [2022-11-21 17:16:55,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188185711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:55,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261445911] [2022-11-21 17:16:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:55,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:55,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:55,808 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:55,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 17:16:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:56,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-21 17:16:56,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:56,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:16:56,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:56,873 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 [2022-11-21 17:16:57,261 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:16:57,261 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 [2022-11-21 17:16:57,297 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:16:57,298 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 [2022-11-21 17:16:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:57,479 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:16:57,479 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 [2022-11-21 17:16:57,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:57,510 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:16:57,510 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 [2022-11-21 17:16:57,537 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 [2022-11-21 17:16:57,552 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 [2022-11-21 17:16:57,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:57,726 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 [2022-11-21 17:16:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:16:57,732 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 [2022-11-21 17:16:57,853 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 [2022-11-21 17:16:57,861 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 [2022-11-21 17:16:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:16:57,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:16:57,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261445911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:57,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:16:57,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2022-11-21 17:16:57,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366618353] [2022-11-21 17:16:57,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:57,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 17:16:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 17:16:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1439, Unknown=2, NotChecked=0, Total=1560 [2022-11-21 17:16:57,940 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) [2022-11-21 17:16:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:59,422 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-21 17:16:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:16:59,423 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 [2022-11-21 17:16:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:59,424 INFO L225 Difference]: With dead ends: 81 [2022-11-21 17:16:59,424 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 17:16:59,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=288, Invalid=2466, Unknown=2, NotChecked=0, Total=2756 [2022-11-21 17:16:59,425 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 396 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:59,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 376 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 494 Invalid, 3 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:16:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 17:16:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-21 17:16:59,428 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) [2022-11-21 17:16:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-21 17:16:59,428 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2022-11-21 17:16:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:59,428 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-21 17:16:59,429 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) [2022-11-21 17:16:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-21 17:16:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 17:16:59,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:59,429 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] [2022-11-21 17:16:59,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 17:16:59,630 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)] === [2022-11-21 17:16:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2022-11-21 17:16:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:59,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498816384] [2022-11-21 17:16:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:17:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:17:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:17:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:17:01,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:01,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498816384] [2022-11-21 17:17:01,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498816384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:01,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564589806] [2022-11-21 17:17:01,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:01,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:01,028 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:01,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 17:17:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 17:17:01,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:01,858 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 [2022-11-21 17:17:01,931 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 [2022-11-21 17:17:01,938 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 [2022-11-21 17:17:01,944 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 [2022-11-21 17:17:01,951 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 [2022-11-21 17:17:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:01,966 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 [2022-11-21 17:17:02,171 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:17:02,171 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 [2022-11-21 17:17:02,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:02,277 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:17:02,277 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 [2022-11-21 17:17:02,287 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 [2022-11-21 17:17:02,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:02,311 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 [2022-11-21 17:17:02,440 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:02,440 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 [2022-11-21 17:17: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 [2022-11-21 17:17:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-21 17:17:02,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:02,529 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-21 17:17:02,529 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 [2022-11-21 17:17:02,535 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 [2022-11-21 17:17:02,600 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 [2022-11-21 17:17:02,616 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 [2022-11-21 17:17:02,645 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 [2022-11-21 17:17:02,698 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 [2022-11-21 17:17:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564589806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:02,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:17:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2022-11-21 17:17:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321434284] [2022-11-21 17:17:02,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:02,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 17:17:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 17:17:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1296, Unknown=15, NotChecked=720, Total=2162 [2022-11-21 17:17:02,701 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) [2022-11-21 17:17:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:04,640 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-11-21 17:17:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:17:04,641 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 [2022-11-21 17:17:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:04,642 INFO L225 Difference]: With dead ends: 103 [2022-11-21 17:17:04,642 INFO L226 Difference]: Without dead ends: 103 [2022-11-21 17:17:04,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=427, Invalid=2674, Unknown=15, NotChecked=1044, Total=4160 [2022-11-21 17:17:04,644 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 935 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:04,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 656 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1041 Invalid, 0 Unknown, 351 Unchecked, 0.7s Time] [2022-11-21 17:17:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-21 17:17:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-11-21 17:17:04,647 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) [2022-11-21 17:17:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-21 17:17:04,647 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2022-11-21 17:17:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:04,648 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-21 17:17:04,648 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) [2022-11-21 17:17:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-21 17:17:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 17:17:04,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:04,649 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] [2022-11-21 17:17:04,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-21 17:17:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 17:17:04,856 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)] === [2022-11-21 17:17:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2022-11-21 17:17:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:04,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299844527] [2022-11-21 17:17:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:17:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:17:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:17:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:17:08,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299844527] [2022-11-21 17:17:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299844527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103062961] [2022-11-21 17:17:08,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:08,430 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:08,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 17:17:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:08,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-21 17:17:08,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:08,837 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 [2022-11-21 17:17:08,896 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 [2022-11-21 17:17:09,039 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:17:09,039 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 [2022-11-21 17:17:09,179 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 [2022-11-21 17:17:09,186 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 [2022-11-21 17:17:09,689 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 [2022-11-21 17:17:10,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:17:10,022 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 [2022-11-21 17:17:10,027 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 [2022-11-21 17:17:10,031 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 [2022-11-21 17:17:10,036 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 [2022-11-21 17:17:10,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:10,763 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 [2022-11-21 17:17:10,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:10,788 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:10,789 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 [2022-11-21 17:17:10,811 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:17:10,811 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 [2022-11-21 17:17:10,834 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:17:10,835 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 [2022-11-21 17:17:11,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:11,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:17:11,695 INFO L321 Elim1Store]: treesize reduction 88, result has 30.2 percent of original size [2022-11-21 17:17:11,695 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 [2022-11-21 17:17:11,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2022-11-21 17:17:11,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:11,992 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-21 17:17:11,992 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 [2022-11-21 17:17:12,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:12,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:12,022 INFO L321 Elim1Store]: treesize reduction 63, result has 28.4 percent of original size [2022-11-21 17:17:12,023 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 [2022-11-21 17:17:12,095 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 [2022-11-21 17:17:12,136 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 [2022-11-21 17:17:12,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:12,418 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-21 17:17:12,419 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 [2022-11-21 17:17:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:12,450 INFO L321 Elim1Store]: treesize reduction 43, result has 36.8 percent of original size [2022-11-21 17:17:12,450 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 [2022-11-21 17:17:13,016 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-21 17:17:13,016 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 [2022-11-21 17:17:13,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:13,045 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-21 17:17:13,046 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 [2022-11-21 17:17:13,122 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 [2022-11-21 17:17:13,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:17:13,164 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 [2022-11-21 17:17:13,392 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 [2022-11-21 17:17:13,399 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 [2022-11-21 17:17:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:13,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:14,029 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 [2022-11-21 17:17:14,050 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 [2022-11-21 17:17:14,087 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 [2022-11-21 17:17:14,106 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 [2022-11-21 17:17:14,566 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 [2022-11-21 17:17:14,616 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 [2022-11-21 17:17:15,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103062961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:15,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:17:15,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 54 [2022-11-21 17:17:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370776710] [2022-11-21 17:17:15,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:15,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-21 17:17:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-21 17:17:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3389, Unknown=86, NotChecked=738, Total=4422 [2022-11-21 17:17:15,324 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) [2022-11-21 17:17:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:23,062 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2022-11-21 17:17:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 17:17:23,063 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 [2022-11-21 17:17:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:23,064 INFO L225 Difference]: With dead ends: 105 [2022-11-21 17:17:23,064 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 17:17:23,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=615, Invalid=6289, Unknown=92, NotChecked=1014, Total=8010 [2022-11-21 17:17:23,067 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1111 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:23,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 924 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1898 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 17:17:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 17:17:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-21 17:17:23,069 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) [2022-11-21 17:17:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-21 17:17:23,070 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2022-11-21 17:17:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:23,070 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-21 17:17:23,071 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) [2022-11-21 17:17:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-21 17:17:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-21 17:17:23,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:23,072 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] [2022-11-21 17:17:23,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:23,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 17:17:23,284 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)] === [2022-11-21 17:17:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2022-11-21 17:17:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:23,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297869947] [2022-11-21 17:17:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:17:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:17:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:17:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:17:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:27,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297869947] [2022-11-21 17:17:27,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297869947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:27,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996913938] [2022-11-21 17:17:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:27,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:27,981 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:27,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 17:17:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:28,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 154 conjunts are in the unsatisfiable core [2022-11-21 17:17:28,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:28,402 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 [2022-11-21 17:17:28,484 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 [2022-11-21 17:17:28,702 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:17:28,703 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 [2022-11-21 17:17:28,915 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 [2022-11-21 17:17:29,050 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 [2022-11-21 17:17:29,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:29,271 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:17:29,272 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 [2022-11-21 17:17:29,558 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 [2022-11-21 17:17:29,645 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 [2022-11-21 17:17:29,939 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 [2022-11-21 17:17:29,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:29,978 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 [2022-11-21 17:17:29,990 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 [2022-11-21 17:17:30,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:17:30,467 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 [2022-11-21 17:17:30,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:30,476 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 [2022-11-21 17:17:30,481 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 [2022-11-21 17:17:30,487 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 [2022-11-21 17:17:31,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:31,255 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:31,256 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 [2022-11-21 17:17:31,275 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:17:31,276 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 [2022-11-21 17:17:31,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:17:31,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:31,313 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:17:31,314 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 [2022-11-21 17:17:31,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:31,330 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 [2022-11-21 17:17:32,356 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-21 17:17:32,357 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 [2022-11-21 17:17:32,379 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:32,379 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 [2022-11-21 17:17:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,390 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 [2022-11-21 17:17:32,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,430 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 [2022-11-21 17:17:32,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,456 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:32,457 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 [2022-11-21 17:17:32,467 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 [2022-11-21 17:17:32,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,562 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:32,562 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 [2022-11-21 17:17:32,579 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 [2022-11-21 17:17:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,590 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 [2022-11-21 17:17:32,908 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:32,909 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 [2022-11-21 17:17:32,915 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 [2022-11-21 17:17:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,923 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 [2022-11-21 17:17:32,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:32,933 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 [2022-11-21 17:17:33,067 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 [2022-11-21 17:17:33,075 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 [2022-11-21 17:17:33,257 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 [2022-11-21 17:17:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:17:33,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:33,745 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 [2022-11-21 17:17:33,763 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 [2022-11-21 17:17:33,792 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 [2022-11-21 17:17:33,807 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 [2022-11-21 17:17:33,826 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 [2022-11-21 17:17:33,843 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 [2022-11-21 17:17:33,879 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 [2022-11-21 17:17:34,007 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 [2022-11-21 17:17:34,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996913938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:34,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:17:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2022-11-21 17:17:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713930295] [2022-11-21 17:17:34,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:34,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-21 17:17:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:34,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-21 17:17:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=4806, Unknown=41, NotChecked=1176, Total=6320 [2022-11-21 17:17:34,014 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) [2022-11-21 17:17:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:41,102 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-11-21 17:17:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:17:41,103 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 [2022-11-21 17:17:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:41,104 INFO L225 Difference]: With dead ends: 103 [2022-11-21 17:17:41,104 INFO L226 Difference]: Without dead ends: 103 [2022-11-21 17:17:41,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=754, Invalid=8356, Unknown=42, NotChecked=1560, Total=10712 [2022-11-21 17:17:41,108 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 528 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:41,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1172 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2378 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2022-11-21 17:17:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-21 17:17:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2022-11-21 17:17:41,111 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) [2022-11-21 17:17:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-21 17:17:41,112 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2022-11-21 17:17:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:41,112 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-21 17:17:41,113 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) [2022-11-21 17:17:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-21 17:17:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 17:17:41,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:41,113 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] [2022-11-21 17:17:41,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:41,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 17:17:41,319 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)] === [2022-11-21 17:17:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2022-11-21 17:17:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604428405] [2022-11-21 17:17:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:17:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:17:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:17:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:17:47,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:47,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604428405] [2022-11-21 17:17:47,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604428405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:47,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444557875] [2022-11-21 17:17:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:47,140 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:47,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 17:17:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:47,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-21 17:17:47,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:47,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 [2022-11-21 17:17:47,655 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 [2022-11-21 17:17:47,879 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:17:47,880 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 [2022-11-21 17:17:48,063 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 [2022-11-21 17:17:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:48,297 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:17:48,297 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 [2022-11-21 17:17:48,543 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 [2022-11-21 17:17:48,727 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:48,727 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 [2022-11-21 17:17:49,042 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:49,043 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 [2022-11-21 17:17:49,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:49,070 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 [2022-11-21 17:17:49,542 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:49,542 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 [2022-11-21 17:17:49,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:49,553 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 [2022-11-21 17:17:49,557 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 [2022-11-21 17:17:50,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:50,304 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:50,304 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 [2022-11-21 17:17:50,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:50,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:50,352 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-21 17:17:50,353 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 [2022-11-21 17:17:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:50,380 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 [2022-11-21 17:17:51,593 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-21 17:17:51,594 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 [2022-11-21 17:17:51,630 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:17:51,630 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 [2022-11-21 17:17:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:51,673 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 [2022-11-21 17:17:51,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:51,698 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:51,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 75 [2022-11-21 17:17:51,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:51,816 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 [2022-11-21 17:17:51,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:51,835 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:17:51,836 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 [2022-11-21 17:17:52,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:17:52,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:52,180 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:52,180 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 [2022-11-21 17:17:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:17:52,202 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 [2022-11-21 17:17:52,482 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 [2022-11-21 17:17:52,935 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:17:52,936 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 [2022-11-21 17:17:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:17:53,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:53,582 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 [2022-11-21 17:17:55,613 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 [2022-11-21 17:17:57,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444557875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:57,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:17:57,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 69 [2022-11-21 17:17:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573695277] [2022-11-21 17:17:57,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:57,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-21 17:17:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-21 17:17:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=5579, Unknown=44, NotChecked=302, Total=6162 [2022-11-21 17:17:57,247 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) [2022-11-21 17:18:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:11,756 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2022-11-21 17:18:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 17:18:11,756 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 [2022-11-21 17:18:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:11,757 INFO L225 Difference]: With dead ends: 141 [2022-11-21 17:18:11,757 INFO L226 Difference]: Without dead ends: 141 [2022-11-21 17:18:11,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=783, Invalid=10310, Unknown=45, NotChecked=418, Total=11556 [2022-11-21 17:18:11,759 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 835 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2619 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2619 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:11,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1055 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2619 Invalid, 2 Unknown, 0 Unchecked, 3.5s Time] [2022-11-21 17:18:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-21 17:18:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2022-11-21 17:18:11,763 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) [2022-11-21 17:18:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-21 17:18:11,763 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2022-11-21 17:18:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:11,764 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-21 17:18:11,764 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) [2022-11-21 17:18:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-21 17:18:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 17:18:11,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:11,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:18:11,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:11,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:11,976 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)] === [2022-11-21 17:18:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2022-11-21 17:18:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617036103] [2022-11-21 17:18:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:18:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:18:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:18:20,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617036103] [2022-11-21 17:18:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617036103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779210699] [2022-11-21 17:18:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:20,898 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:20,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 17:18:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:21,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-21 17:18:21,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:21,446 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 [2022-11-21 17:18:22,033 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 [2022-11-21 17:18:22,036 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 [2022-11-21 17:18:22,471 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:18:22,472 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 [2022-11-21 17:18:22,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:18:22,506 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 [2022-11-21 17:18:22,838 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 [2022-11-21 17:18:22,858 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 [2022-11-21 17:18:23,097 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:23,097 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 [2022-11-21 17:18:23,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 18 treesize of output 20 [2022-11-21 17:18:23,554 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:23,555 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 [2022-11-21 17:18:23,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:23,590 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 [2022-11-21 17:18:23,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:23,733 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 [2022-11-21 17:18:23,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:23,755 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 [2022-11-21 17:18:24,398 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:18:24,398 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 [2022-11-21 17:18:24,408 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 [2022-11-21 17:18:24,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:24,416 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 [2022-11-21 17:18:24,422 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 [2022-11-21 17:18:25,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:25,382 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 [2022-11-21 17:18:25,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:25,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:25,400 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 [2022-11-21 17:18:25,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:25,426 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:18:25,427 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 [2022-11-21 17:18:25,477 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:18:25,478 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 [2022-11-21 17:18:26,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:26,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:18:26,962 INFO L321 Elim1Store]: treesize reduction 134, result has 18.8 percent of original size [2022-11-21 17:18:26,962 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 [2022-11-21 17:18:26,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:27,000 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:18:27,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 92 [2022-11-21 17:18:27,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:27,326 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-21 17:18:27,326 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 [2022-11-21 17:18:27,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:27,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:27,350 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 [2022-11-21 17:18:27,493 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-21 17:18:27,494 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 [2022-11-21 17:18:27,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:27,534 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:18:27,534 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 [2022-11-21 17:18:28,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:28,172 INFO L321 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2022-11-21 17:18:28,173 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 [2022-11-21 17:18:28,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:28,212 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-21 17:18:28,212 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 [2022-11-21 17:18:29,149 INFO L321 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-11-21 17:18:29,149 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 [2022-11-21 17:18:29,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:29,547 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:18:29,548 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 [2022-11-21 17:18:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:18:29,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:30,963 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5740 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (forall ((v_ArrVal_5744 Int) (v_ArrVal_5742 Int) (v_ArrVal_5739 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5739))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_5744))) (.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_5742)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))))) (not (<= 0 .cse6)))))) (forall ((v_ArrVal_5740 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5740))) (let ((.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (forall ((v_ArrVal_5744 Int) (v_ArrVal_5742 Int) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ 8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5739))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse8 (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 v_ArrVal_5744)))) (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_5742)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (<= 0 .cse11))))))) is different from false [2022-11-21 17:18:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779210699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:40,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:40,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 74 [2022-11-21 17:18:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797230648] [2022-11-21 17:18:40,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:40,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-21 17:18:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-21 17:18:40,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=7267, Unknown=71, NotChecked=172, Total=7832 [2022-11-21 17:18:40,819 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) [2022-11-21 17:18:47,703 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] [2022-11-21 17:19:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:00,835 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-11-21 17:19:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 17:19:00,836 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 [2022-11-21 17:19:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:00,837 INFO L225 Difference]: With dead ends: 157 [2022-11-21 17:19:00,837 INFO L226 Difference]: Without dead ends: 157 [2022-11-21 17:19:00,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3277 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=904, Invalid=12835, Unknown=71, NotChecked=232, Total=14042 [2022-11-21 17:19:00,839 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1164 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 3180 mSolverCounterSat, 80 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3180 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:00,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1271 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3180 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-11-21 17:19:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-21 17:19:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 90. [2022-11-21 17:19:00,842 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) [2022-11-21 17:19:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-21 17:19:00,843 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2022-11-21 17:19:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:00,843 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-21 17:19:00,844 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) [2022-11-21 17:19:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-21 17:19:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 17:19:00,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:00,845 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] [2022-11-21 17:19:00,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-21 17:19:01,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-21 17:19:01,051 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)] === [2022-11-21 17:19:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2022-11-21 17:19:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877229874] [2022-11-21 17:19:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:19:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:19:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:19:05,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:05,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877229874] [2022-11-21 17:19:05,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877229874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:05,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509021720] [2022-11-21 17:19:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:05,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:05,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:05,010 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:05,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 17:19:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:05,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-21 17:19:05,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:05,477 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 [2022-11-21 17:19:05,558 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 [2022-11-21 17:19:05,792 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 [2022-11-21 17:19:05,795 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 [2022-11-21 17:19:05,818 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 [2022-11-21 17:19:05,821 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 [2022-11-21 17:19:05,872 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 [2022-11-21 17:19:05,875 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 [2022-11-21 17:19:05,910 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 [2022-11-21 17:19:05,913 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 [2022-11-21 17:19:06,075 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 [2022-11-21 17:19:06,078 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 [2022-11-21 17:19:06,187 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 [2022-11-21 17:19:06,192 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 [2022-11-21 17:19:06,258 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 [2022-11-21 17:19:06,263 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 [2022-11-21 17:19:06,316 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 [2022-11-21 17:19:06,344 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 [2022-11-21 17:19:06,348 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 [2022-11-21 17:19:06,478 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:19:06,478 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 [2022-11-21 17:19:06,521 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 [2022-11-21 17:19:06,526 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 [2022-11-21 17:19:06,597 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 [2022-11-21 17:19:06,602 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 [2022-11-21 17:19:06,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:19:06,708 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 [2022-11-21 17:19:06,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:06,777 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 [2022-11-21 17:19:06,821 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 [2022-11-21 17:19:06,826 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 [2022-11-21 17:19:06,895 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 [2022-11-21 17:19:06,899 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 [2022-11-21 17:19:06,985 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 [2022-11-21 17:19:06,990 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 [2022-11-21 17:19:07,034 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:19:07,035 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 [2022-11-21 17:19:07,044 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 [2022-11-21 17:19:07,085 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 [2022-11-21 17:19:07,090 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 [2022-11-21 17:19:07,164 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 [2022-11-21 17:19:07,168 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 [2022-11-21 17:19:07,302 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 [2022-11-21 17:19:07,307 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 [2022-11-21 17:19:07,376 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 [2022-11-21 17:19:07,380 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 [2022-11-21 17:19:07,459 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 [2022-11-21 17:19:07,463 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 [2022-11-21 17:19:07,531 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 [2022-11-21 17:19:07,536 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 [2022-11-21 17:19:07,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:07,635 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 [2022-11-21 17:19:07,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:07,683 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:07,684 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 [2022-11-21 17:19:07,904 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 [2022-11-21 17:19:07,912 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 [2022-11-21 17:19:08,222 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 [2022-11-21 17:19:08,230 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 [2022-11-21 17:19:08,819 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 [2022-11-21 17:19:08,825 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 [2022-11-21 17:19:09,115 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 [2022-11-21 17:19:09,121 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 [2022-11-21 17:19:09,347 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 [2022-11-21 17:19:09,353 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 [2022-11-21 17:19:09,471 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-21 17:19:09,471 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 [2022-11-21 17:19:09,501 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:19:09,502 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 [2022-11-21 17:19:09,510 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 [2022-11-21 17:19:09,709 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 [2022-11-21 17:19:09,715 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 [2022-11-21 17:19:09,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:09,792 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:09,792 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 [2022-11-21 17:19:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:09,809 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 [2022-11-21 17:19:10,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:10,209 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:10,209 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 [2022-11-21 17:19:10,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:10,259 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 [2022-11-21 17:19:10,526 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 [2022-11-21 17:19:10,532 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 [2022-11-21 17:19:11,020 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 [2022-11-21 17:19:11,026 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 [2022-11-21 17:19:11,146 INFO L321 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2022-11-21 17:19:11,146 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 [2022-11-21 17:19:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:11,331 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 [2022-11-21 17:19:11,394 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 [2022-11-21 17:19:11,400 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 [2022-11-21 17:19:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-21 17:19:12,192 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 [2022-11-21 17:19:12,198 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 [2022-11-21 17:19:12,511 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 [2022-11-21 17:19:12,517 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 [2022-11-21 17:19:13,231 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 [2022-11-21 17:19:13,237 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 [2022-11-21 17:19:13,496 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 [2022-11-21 17:19:13,502 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 [2022-11-21 17:19:13,584 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-21 17:19:13,585 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 [2022-11-21 17:19:13,865 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 [2022-11-21 17:19:13,952 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 [2022-11-21 17:19:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-21 17:19:13,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:13,988 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 [2022-11-21 17:19:13,997 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 [2022-11-21 17:19:14,016 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 [2022-11-21 17:19:14,044 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 [2022-11-21 17:19:14,060 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 [2022-11-21 17:19:14,073 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 [2022-11-21 17:19:14,087 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 [2022-11-21 17:19:14,115 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 [2022-11-21 17:19:14,232 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 [2022-11-21 17:19:14,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509021720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:14,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2022-11-21 17:19:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807254549] [2022-11-21 17:19:14,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-21 17:19:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-21 17:19:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1617, Unknown=75, NotChecked=5082, Total=6972 [2022-11-21 17:19:14,237 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) [2022-11-21 17:19:14,867 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 [2022-11-21 17:19:14,870 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 [2022-11-21 17:19:14,875 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 [2022-11-21 17:19:14,878 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 [2022-11-21 17:19:14,883 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 [2022-11-21 17:19:14,887 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 [2022-11-21 17:19:14,894 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 [2022-11-21 17:19:14,897 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 [2022-11-21 17:19:14,904 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 [2022-11-21 17:19:14,908 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 [2022-11-21 17:19:14,919 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 [2022-11-21 17:19:14,925 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 [2022-11-21 17:19:14,942 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 [2022-11-21 17:19:14,947 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 [2022-11-21 17:19:14,959 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 [2022-11-21 17:19:14,964 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 [2022-11-21 17:19:14,978 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 [2022-11-21 17:19:14,983 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 [2022-11-21 17:19:15,003 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 [2022-11-21 17:19:15,008 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 [2022-11-21 17:19:15,025 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 [2022-11-21 17:19:15,031 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 [2022-11-21 17:19:15,049 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 [2022-11-21 17:19:15,055 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 [2022-11-21 17:19:15,069 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 [2022-11-21 17:19:15,074 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 [2022-11-21 17:19:15,091 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 [2022-11-21 17:19:15,096 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 [2022-11-21 17:19:15,107 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 [2022-11-21 17:19:15,112 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 [2022-11-21 17:19:15,124 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 [2022-11-21 17:19:15,128 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 [2022-11-21 17:19:15,146 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 [2022-11-21 17:19:15,151 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 [2022-11-21 17:19:15,164 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 [2022-11-21 17:19:15,170 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 [2022-11-21 17:19:15,192 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 [2022-11-21 17:19:15,197 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 [2022-11-21 17:19:15,271 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 [2022-11-21 17:19:15,278 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 [2022-11-21 17:19:15,343 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 [2022-11-21 17:19:15,349 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 [2022-11-21 17:19:15,454 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 [2022-11-21 17:19:15,460 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 [2022-11-21 17:19:15,494 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 [2022-11-21 17:19:15,500 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 [2022-11-21 17:19:15,551 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 [2022-11-21 17:19:15,557 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 [2022-11-21 17:19:15,656 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 [2022-11-21 17:19:15,663 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 [2022-11-21 17:19:15,733 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 [2022-11-21 17:19:15,740 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 [2022-11-21 17:19:15,812 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 [2022-11-21 17:19:15,818 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 [2022-11-21 17:19:15,866 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 [2022-11-21 17:19:15,873 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 [2022-11-21 17:19:15,919 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 [2022-11-21 17:19:15,924 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 [2022-11-21 17:19:15,966 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 [2022-11-21 17:19:15,972 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 [2022-11-21 17:19:16,030 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 [2022-11-21 17:19:16,036 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 [2022-11-21 17:19:16,097 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 [2022-11-21 17:19:16,103 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 [2022-11-21 17:19:16,162 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 [2022-11-21 17:19:16,167 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 [2022-11-21 17:19:16,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.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 [2022-11-21 17:19:16,255 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 [2022-11-21 17:19:16,326 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 [2022-11-21 17:19:16,332 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 [2022-11-21 17:19:16,382 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 [2022-11-21 17:19:16,388 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 [2022-11-21 17:19:16,428 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 [2022-11-21 17:19:16,441 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 [2022-11-21 17:19:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:16,703 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-11-21 17:19:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-21 17:19:16,704 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 [2022-11-21 17:19:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:16,705 INFO L225 Difference]: With dead ends: 106 [2022-11-21 17:19:16,705 INFO L226 Difference]: Without dead ends: 106 [2022-11-21 17:19:16,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 79 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=297, Invalid=1850, Unknown=149, NotChecked=12956, Total=15252 [2022-11-21 17:19:16,707 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1603 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 893 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 1603 Unchecked, 0.5s Time] [2022-11-21 17:19:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-21 17:19:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-21 17:19:16,711 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) [2022-11-21 17:19:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-11-21 17:19:16,712 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2022-11-21 17:19:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-11-21 17:19:16,713 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) [2022-11-21 17:19:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-11-21 17:19:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:19:16,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:16,714 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] [2022-11-21 17:19:16,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-21 17:19:16,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:16,922 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)] === [2022-11-21 17:19:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2022-11-21 17:19:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:16,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221701925] [2022-11-21 17:19:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:19:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:19:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:19:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221701925] [2022-11-21 17:19:25,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221701925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987975677] [2022-11-21 17:19:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:25,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:25,678 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:25,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-21 17:19:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:26,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-21 17:19:26,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:26,324 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 [2022-11-21 17:19:26,497 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 [2022-11-21 17:19:27,190 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 [2022-11-21 17:19:27,195 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 [2022-11-21 17:19:28,257 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:19:28,257 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 [2022-11-21 17:19:28,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 14 treesize of output 16 [2022-11-21 17:19:28,781 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 [2022-11-21 17:19:28,807 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 [2022-11-21 17:19:28,836 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 [2022-11-21 17:19:29,162 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 [2022-11-21 17:19:29,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 17:19:29,196 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 [2022-11-21 17:19:29,726 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 [2022-11-21 17:19:29,736 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 [2022-11-21 17:19:29,788 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 [2022-11-21 17:19:29,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:29,820 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 [2022-11-21 17:19:29,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:29,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 53 treesize of output 36 [2022-11-21 17:19:29,841 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 [2022-11-21 17:19:30,607 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:19:30,607 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 [2022-11-21 17:19:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:30,617 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 [2022-11-21 17:19:30,623 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 [2022-11-21 17:19:30,629 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 [2022-11-21 17:19:31,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:31,796 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:31,797 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 [2022-11-21 17:19:31,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:31,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:31,826 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:19:31,827 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 [2022-11-21 17:19:31,869 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 17:19:31,870 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 [2022-11-21 17:19:31,884 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 [2022-11-21 17:19:31,915 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:19:31,915 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 [2022-11-21 17:19:33,814 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-21 17:19:33,814 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 [2022-11-21 17:19:33,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:33,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:19:33,867 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:19:33,867 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 [2022-11-21 17:19:33,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:19:33,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:33,886 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 [2022-11-21 17:19:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,175 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:34,176 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 [2022-11-21 17:19:34,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,202 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 [2022-11-21 17:19:34,226 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 [2022-11-21 17:19:34,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,377 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:19:34,377 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 [2022-11-21 17:19:34,397 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 [2022-11-21 17:19:34,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:34,409 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 [2022-11-21 17:19:35,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:35,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:19:35,012 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:19:35,013 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 [2022-11-21 17:19:35,030 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 [2022-11-21 17:19:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:35,056 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-21 17:19:35,057 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 [2022-11-21 17:19:36,552 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-21 17:19:36,553 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 [2022-11-21 17:19:36,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:36,566 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:19:36,567 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 [2022-11-21 17:19:36,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:19:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:19:37,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:39,542 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 [2022-11-21 17:19:39,724 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 [2022-11-21 17:19:39,787 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 [2022-11-21 17:19:39,855 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 [2022-11-21 17:19:39,925 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 [2022-11-21 17:19:40,098 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 [2022-11-21 17:19:41,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987975677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:41,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:41,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39] total 81 [2022-11-21 17:19:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151165862] [2022-11-21 17:19:41,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:41,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-21 17:19:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-21 17:19:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=7670, Unknown=17, NotChecked=1086, Total=9120 [2022-11-21 17:19:41,841 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) [2022-11-21 17:20:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:20:04,240 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-11-21 17:20:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 17:20:04,241 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 [2022-11-21 17:20:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:20:04,242 INFO L225 Difference]: With dead ends: 125 [2022-11-21 17:20:04,242 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 17:20:04,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 126 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=954, Invalid=13814, Unknown=18, NotChecked=1470, Total=16256 [2022-11-21 17:20:04,245 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 549 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:20:04,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1415 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3301 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-11-21 17:20:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 17:20:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2022-11-21 17:20:04,248 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) [2022-11-21 17:20:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-11-21 17:20:04,249 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 67 [2022-11-21 17:20:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:20:04,249 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-11-21 17:20:04,250 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) [2022-11-21 17:20:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-11-21 17:20:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 17:20:04,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:20:04,251 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] [2022-11-21 17:20:04,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-21 17:20:04,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:04,455 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)] === [2022-11-21 17:20:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:20:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash -925225159, now seen corresponding path program 2 times [2022-11-21 17:20:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:20:04,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647253010] [2022-11-21 17:20:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:20:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:20:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 17:20:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 17:20:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:20:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:20:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647253010] [2022-11-21 17:20:16,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647253010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890906515] [2022-11-21 17:20:16,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:20:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:20:16,555 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:20:16,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36972e7f-f0c9-400c-a068-61b2d3da6451/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-21 17:20:17,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:20:17,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:20:17,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 215 conjunts are in the unsatisfiable core [2022-11-21 17:20:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:20:17,296 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 [2022-11-21 17:20:17,304 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 [2022-11-21 17:20:17,431 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 [2022-11-21 17:20:17,436 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 [2022-11-21 17:20:17,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:17,986 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 [2022-11-21 17:20:18,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:18,008 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 [2022-11-21 17:20:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:18,399 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 [2022-11-21 17:20:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:18,405 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 [2022-11-21 17:20:18,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:18,831 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-21 17:20:18,832 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 [2022-11-21 17:20:18,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:18,855 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 [2022-11-21 17:20:19,371 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 [2022-11-21 17:20:19,646 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 [2022-11-21 17:20:20,224 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 [2022-11-21 17:20:20,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:20,488 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:20:20,489 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 [2022-11-21 17:20:21,349 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-21 17:20:21,350 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 [2022-11-21 17:20:21,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:21,358 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 [2022-11-21 17:20:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:21,366 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 [2022-11-21 17:20:21,384 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 [2022-11-21 17:20:22,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:22,891 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-21 17:20:22,891 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 [2022-11-21 17:20:22,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:22,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:22,922 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 17:20:22,922 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 [2022-11-21 17:20:22,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:22,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:22,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:23,022 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-21 17:20:23,022 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 [2022-11-21 17:20:23,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:23,067 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 [2022-11-21 17:20:25,398 INFO L321 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2022-11-21 17:20:25,399 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 [2022-11-21 17:20:25,462 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-21 17:20:25,462 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 [2022-11-21 17:20:27,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:27,377 INFO L321 Elim1Store]: treesize reduction 132, result has 53.4 percent of original size [2022-11-21 17:20:27,378 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 [2022-11-21 17:20:27,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:27,617 INFO L321 Elim1Store]: treesize reduction 102, result has 50.2 percent of original size [2022-11-21 17:20:27,618 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 [2022-11-21 17:20:44,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-21 17:20:45,130 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 [2022-11-21 17:20:48,628 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 [2022-11-21 17:20:53,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-21 17:20:55,908 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 [2022-11-21 17:20:56,085 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 [2022-11-21 17:20:56,318 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:21:05,996 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 [2022-11-21 17:21:08,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:21:10,829 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:21:16,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:21:17,319 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-21 17:21:17,319 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 [2022-11-21 17:21:29,839 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 [2022-11-21 17:21:30,112 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 [2022-11-21 17:21:30,798 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 [2022-11-21 17:21:31,317 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 [2022-11-21 17:21:31,383 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 [2022-11-21 17:21:31,442 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 [2022-11-21 17:21:31,816 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 [2022-11-21 17:21:31,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2022-11-21 17:21:32,117 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 [2022-11-21 17:21:32,220 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 [2022-11-21 17:21:48,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:48,770 INFO L321 Elim1Store]: treesize reduction 495, result has 23.7 percent of original size [2022-11-21 17:21:48,771 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 [2022-11-21 17:21:48,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:49,233 INFO L321 Elim1Store]: treesize reduction 306, result has 28.3 percent of original size [2022-11-21 17:21:49,233 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 [2022-11-21 17:22:14,002 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:22:14,379 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 [2022-11-21 17:22:15,202 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 [2022-11-21 17:22:15,711 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 [2022-11-21 17:22:15,918 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 [2022-11-21 17:22:16,257 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 [2022-11-21 17:22:19,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:19,325 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 [2022-11-21 17:22:19,713 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 [2022-11-21 17:22:20,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:20,793 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 [2022-11-21 17:22:21,380 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 [2022-11-21 17:22:22,402 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 [2022-11-21 17:22:23,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:22:23,782 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 [2022-11-21 17:22:27,774 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 [2022-11-21 17:22:28,873 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 [2022-11-21 17:22:29,743 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 [2022-11-21 17:22:30,412 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 [2022-11-21 17:22:36,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:22:37,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:22:40,487 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 [2022-11-21 17:22:48,524 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 [2022-11-21 17:22:49,793 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 [2022-11-21 17:22:50,694 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 [2022-11-21 17:22:51,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:22:52,198 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 [2022-11-21 17:22:52,849 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 [2022-11-21 17:23:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,020 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 1 [2022-11-21 17:23:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,300 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 1 [2022-11-21 17:23:13,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,531 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 1 [2022-11-21 17:23:13,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,778 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 1 [2022-11-21 17:23:14,098 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 [2022-11-21 17:23:14,384 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:15,198 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 [2022-11-21 17:23:15,532 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 [2022-11-21 17:23:15,848 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 [2022-11-21 17:23:16,257 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 [2022-11-21 17:23:16,548 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:19,413 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:19,712 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 1 [2022-11-21 17:23:19,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:19,962 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 1 [2022-11-21 17:23:20,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:20,228 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 1 [2022-11-21 17:23:20,582 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 [2022-11-21 17:23:21,012 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:21,126 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:21,608 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 1 [2022-11-21 17:23:21,701 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:23:21,877 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 [2022-11-21 17:23:22,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:22,365 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 1 [2022-11-21 17:26:30,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:26:30,490 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 [2022-11-21 17:26:32,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:32,339 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 [2022-11-21 17:26:32,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:32,583 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 [2022-11-21 17:26:32,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:32,801 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 [2022-11-21 17:26:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:32,924 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 [2022-11-21 17:26:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:33,480 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 [2022-11-21 17:26:33,702 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 [2022-11-21 17:26:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:34,102 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 [2022-11-21 17:26:34,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:26:34,896 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 [2022-11-21 17:26:35,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:35,240 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 [2022-11-21 17:26:35,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:35,346 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 [2022-11-21 17:26:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:36,952 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 [2022-11-21 17:26:37,037 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 [2022-11-21 17:26:39,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:39,293 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 [2022-11-21 17:26:41,194 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 [2022-11-21 17:26:57,914 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 [2022-11-21 17:26:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:58,523 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 [2022-11-21 17:27:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:00,535 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 3559 treesize of output 3523 [2022-11-21 17:27:09,006 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 [2022-11-21 17:27:10,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:10,284 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 [2022-11-21 17:27:11,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:11,837 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 [2022-11-21 17:27:12,251 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 [2022-11-21 17:27:15,159 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 [2022-11-21 17:27:17,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:27:17,570 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 [2022-11-21 17:27:18,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:18,069 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 [2022-11-21 17:27:18,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:18,331 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 [2022-11-21 17:27:19,593 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 [2022-11-21 17:27:21,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 17:27:23,423 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 [2022-11-21 17:27:26,107 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 [2022-11-21 17:27:27,017 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 [2022-11-21 17:29:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:29:49,608 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 [2022-11-21 17:29:49,934 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 [2022-11-21 17:29:50,301 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 [2022-11-21 17:29:50,538 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 [2022-11-21 17:29:50,851 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