./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/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_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- 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 16:33:44,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:33:44,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:33:44,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:33:44,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:33:44,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:33:44,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:33:44,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:33:44,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:33:44,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:33:44,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:33:44,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:33:44,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:33:44,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:33:44,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:33:44,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:33:44,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:33:44,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:33:44,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:33:44,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:33:44,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:33:44,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:33:44,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:33:44,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:33:44,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:33:44,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:33:44,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:33:44,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:33:44,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:33:44,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:33:44,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:33:44,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:33:44,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:33:44,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:33:44,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:33:44,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:33:44,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:33:44,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:33:44,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:33:44,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:33:44,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:33:44,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:33:44,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:33:44,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:33:44,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:33:44,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:33:44,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:33:44,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:33:44,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:33:44,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:33:44,276 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:33:44,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:33:44,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:33:44,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:33:44,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:33:44,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:33:44,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:33:44,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:33:44,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:33:44,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:33:44,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:33:44,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:33:44,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:33:44,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:33:44,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:33:44,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:33:44,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:33:44,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:33:44,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:33:44,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:33:44,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:33:44,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:33:44,282 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:33:44,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:33:44,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:33:44,283 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_8ba683dc-040f-4e5b-838b-871b1e25d3ac/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_8ba683dc-040f-4e5b-838b-871b1e25d3ac/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-11-21 16:33:44,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:33:44,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:33:44,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:33:44,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:33:44,597 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:33:44,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-21 16:33:47,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:33:47,906 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:33:47,907 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-21 16:33:47,930 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/data/4fd183c33/2453fea7978847f0a9082aba3594359a/FLAG3184df83a [2022-11-21 16:33:47,950 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/data/4fd183c33/2453fea7978847f0a9082aba3594359a [2022-11-21 16:33:47,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:33:47,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:33:47,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:33:47,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:33:47,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:33:47,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:33:47" (1/1) ... [2022-11-21 16:33:47,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5d638e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:47, skipping insertion in model container [2022-11-21 16:33:47,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:33:47" (1/1) ... [2022-11-21 16:33:47,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:33:48,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:33:48,317 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_8ba683dc-040f-4e5b-838b-871b1e25d3ac/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-21 16:33:48,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:33:48,333 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:33:48,372 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_8ba683dc-040f-4e5b-838b-871b1e25d3ac/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-21 16:33:48,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:33:48,399 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:33:48,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48 WrapperNode [2022-11-21 16:33:48,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:33:48,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:33:48,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:33:48,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:33:48,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,446 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-11-21 16:33:48,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:33:48,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:33:48,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:33:48,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:33:48,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,474 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:33:48,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:33:48,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:33:48,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:33:48,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (1/1) ... [2022-11-21 16:33:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:33:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:48,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:33:48,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:33:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:33:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:33:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 16:33:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 16:33:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:33:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:33:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:33:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:33:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:33:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:33:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:33:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:33:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:33:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:33:48,736 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:33:48,744 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:33:49,102 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:33:49,109 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:33:49,109 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:33:49,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:33:49 BoogieIcfgContainer [2022-11-21 16:33:49,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:33:49,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:33:49,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:33:49,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:33:49,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:33:47" (1/3) ... [2022-11-21 16:33:49,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e02e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:33:49, skipping insertion in model container [2022-11-21 16:33:49,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:48" (2/3) ... [2022-11-21 16:33:49,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e02e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:33:49, skipping insertion in model container [2022-11-21 16:33:49,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:33:49" (3/3) ... [2022-11-21 16:33:49,121 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-11-21 16:33:49,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:33:49,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:33:49,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:33:49,203 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70769458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:33:49,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:33:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:33:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 16:33:49,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:49,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:49,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:49,227 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-21 16:33:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913489598] [2022-11-21 16:33:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:33:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:33:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:49,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913489598] [2022-11-21 16:33:49,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913489598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:49,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:49,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:33:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818749114] [2022-11-21 16:33:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:49,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:33:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:33:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:49,730 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:33:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:49,812 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-21 16:33:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:33:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-21 16:33:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:49,822 INFO L225 Difference]: With dead ends: 65 [2022-11-21 16:33:49,822 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 16:33:49,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 16:33:49,828 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:49,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 16:33:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-21 16:33:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:33:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-21 16:33:49,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-21 16:33:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:49,869 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-21 16:33:49,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:33:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-21 16:33:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 16:33:49,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:49,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:49,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:33:49,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-21 16:33:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:49,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443450219] [2022-11-21 16:33:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:33:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:33:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:50,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443450219] [2022-11-21 16:33:50,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443450219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:50,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:50,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:33:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652957459] [2022-11-21 16:33:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:50,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:33:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:33:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:33:50,200 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:33:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:50,291 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-21 16:33:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-21 16:33:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:50,299 INFO L225 Difference]: With dead ends: 52 [2022-11-21 16:33:50,299 INFO L226 Difference]: Without dead ends: 31 [2022-11-21 16:33:50,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:33:50,306 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:50,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-21 16:33:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-21 16:33:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 16:33:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-21 16:33:50,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-21 16:33:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:50,318 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-21 16:33:50,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:33:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-21 16:33:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:33:50,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:50,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:50,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:33:50,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-21 16:33:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:50,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060925767] [2022-11-21 16:33:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:33:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:33:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:33:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:51,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060925767] [2022-11-21 16:33:51,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060925767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731119787] [2022-11-21 16:33:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:51,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:51,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:51,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:51,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:33:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:51,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 16:33:51,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:51,696 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 16:33:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:51,810 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 16:33:51,859 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 16:33:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:33:51,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:52,031 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| Int) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-21 16:33:52,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731119787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:52,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:33:52,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-21 16:33:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750353369] [2022-11-21 16:33:52,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:52,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 16:33:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 16:33:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-11-21 16:33:52,036 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 16:33:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:52,638 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-11-21 16:33:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:33:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 32 [2022-11-21 16:33:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:52,640 INFO L225 Difference]: With dead ends: 39 [2022-11-21 16:33:52,640 INFO L226 Difference]: Without dead ends: 31 [2022-11-21 16:33:52,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=788, Unknown=1, NotChecked=58, Total=992 [2022-11-21 16:33:52,641 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:52,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:33:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-21 16:33:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-21 16:33:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 16:33:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-21 16:33:52,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-21 16:33:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:52,649 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-21 16:33:52,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 16:33:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-21 16:33:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 16:33:52,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:52,651 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:33:52,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:52,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:52,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-21 16:33:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:52,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230043529] [2022-11-21 16:33:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:52,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:33:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:33:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:33:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:54,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230043529] [2022-11-21 16:33:54,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230043529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:54,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780867636] [2022-11-21 16:33:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:54,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:54,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:33:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:54,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-21 16:33:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:54,607 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 16:33:54,876 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:33:54,877 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 16:33:54,962 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 16:33:55,060 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:33:55,061 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 28 treesize of output 29 [2022-11-21 16:33:55,220 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:33:55,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-21 16:33:55,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:33:55,236 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 16:33:55,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:55,425 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:33:55,426 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 53 treesize of output 51 [2022-11-21 16:33:55,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:55,434 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 49 [2022-11-21 16:33:55,457 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-21 16:33:55,457 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 32 treesize of output 34 [2022-11-21 16:33:55,576 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 35 treesize of output 23 [2022-11-21 16:33:55,642 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:33:55,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-11-21 16:33:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:55,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:55,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780867636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:55,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:33:55,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2022-11-21 16:33:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046313399] [2022-11-21 16:33:55,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:55,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-21 16:33:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 16:33:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 16:33:55,927 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 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 16:33:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:57,922 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-11-21 16:33:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 16:33:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 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 35 [2022-11-21 16:33:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:57,924 INFO L225 Difference]: With dead ends: 55 [2022-11-21 16:33:57,924 INFO L226 Difference]: Without dead ends: 46 [2022-11-21 16:33:57,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=345, Invalid=2411, Unknown=0, NotChecked=0, Total=2756 [2022-11-21 16:33:57,926 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 129 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:57,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 293 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:33:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-21 16:33:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-11-21 16:33:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 16:33:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-21 16:33:57,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 35 [2022-11-21 16:33:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:57,939 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-21 16:33:57,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 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 16:33:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-21 16:33:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 16:33:57,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:57,940 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:33:57,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:58,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:58,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-21 16:33:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:58,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340754388] [2022-11-21 16:33:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:34:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:34:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:34:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:34:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340754388] [2022-11-21 16:34:00,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340754388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312480749] [2022-11-21 16:34:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:00,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:00,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:00,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:34:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:00,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-21 16:34:00,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:00,962 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 16:34:01,020 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 16:34:01,165 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from false [2022-11-21 16:34:01,168 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) is different from true [2022-11-21 16:34:01,200 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-21 16:34:01,204 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-21 16:34:01,265 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2022-11-21 16:34:01,268 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2022-11-21 16:34:01,313 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-21 16:34:01,317 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-21 16:34:01,403 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2022-11-21 16:34:01,405 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2022-11-21 16:34:01,519 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-21 16:34:01,523 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-21 16:34:01,572 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 16:34:01,608 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-21 16:34:01,612 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-21 16:34:01,742 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:34:01,742 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 16:34:01,780 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))))) is different from false [2022-11-21 16:34:01,784 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_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))))) is different from true [2022-11-21 16:34:01,887 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-21 16:34:01,892 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-21 16:34:01,941 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-21 16:34:01,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-11-21 16:34:01,975 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-11-21 16:34:01,979 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-11-21 16:34:02,065 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)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-21 16:34:02,070 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)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-21 16:34:02,221 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 16:34:02,245 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744)))) is different from false [2022-11-21 16:34:02,250 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744)))) is different from true [2022-11-21 16:34:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:02,423 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:34:02,424 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 62 treesize of output 60 [2022-11-21 16:34:02,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:02,441 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 41 treesize of output 41 [2022-11-21 16:34:02,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2022-11-21 16:34:02,614 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2022-11-21 16:34:02,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2022-11-21 16:34:02,826 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2022-11-21 16:34:03,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from false [2022-11-21 16:34:03,045 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from true [2022-11-21 16:34:03,366 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from false [2022-11-21 16:34:03,371 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from true [2022-11-21 16:34:03,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-11-21 16:34:03,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,786 INFO L321 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-11-21 16:34:03,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 118 [2022-11-21 16:34:03,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,859 INFO L321 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-11-21 16:34:03,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 73 [2022-11-21 16:34:03,905 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 0 case distinctions, treesize of input 69 treesize of output 58 [2022-11-21 16:34:03,919 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 16:34:03,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:03,933 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 25 treesize of output 29 [2022-11-21 16:34:04,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (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_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse5)))))))) is different from false [2022-11-21 16:34:04,063 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (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_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_33 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_32) v_arrayElimCell_33))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= 1 (select |v_#valid_BEFORE_CALL_13| .cse5)))))))) is different from true [2022-11-21 16:34:04,125 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 16:34:04,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 44 [2022-11-21 16:34:04,155 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 16:34:04,237 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) is different from false [2022-11-21 16:34:04,242 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) is different from true [2022-11-21 16:34:04,294 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 16:34:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-21 16:34:04,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:34:11,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:11,780 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 137 [2022-11-21 16:34:11,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:11,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 614 treesize of output 615 [2022-11-21 16:34:11,831 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 516 treesize of output 424 [2022-11-21 16:34:11,847 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 234 treesize of output 188 [2022-11-21 16:34:22,370 WARN L233 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:34:22,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312480749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:22,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:34:22,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2022-11-21 16:34:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615028166] [2022-11-21 16:34:22,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:22,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-21 16:34:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-21 16:34:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=918, Unknown=101, NotChecked=1422, Total=2550 [2022-11-21 16:34:22,377 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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 16:34:25,442 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-21 16:34:25,446 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-21 16:34:25,451 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-21 16:34:25,455 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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-21 16:34:25,462 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |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 16:34:25,465 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |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 16:34:25,472 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |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)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2022-11-21 16:34:25,476 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |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)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-21 16:34:25,486 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (or .cse1 (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from false [2022-11-21 16:34:25,493 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (or .cse1 (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from true [2022-11-21 16:34:25,506 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-21 16:34:25,511 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-21 16:34:25,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-21 16:34:25,531 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-21 16:34:25,549 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-21 16:34:25,554 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-21 16:34:25,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-21 16:34:25,577 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-21 16:34:25,595 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |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 16:34:25,601 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |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 16:34:25,626 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2022-11-21 16:34:25,631 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-21 16:34:27,936 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from false [2022-11-21 16:34:27,943 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|))) is different from true [2022-11-21 16:34:28,085 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2022-11-21 16:34:28,093 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2022-11-21 16:34:28,197 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from false [2022-11-21 16:34:28,204 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from true [2022-11-21 16:34:28,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from false [2022-11-21 16:34:28,302 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) is different from true [2022-11-21 16:34:28,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from false [2022-11-21 16:34:28,369 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (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 (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) is different from true [2022-11-21 16:34:28,454 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 4)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from false [2022-11-21 16:34:28,461 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_32 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_35) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_32) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= 0 (select |v_#valid_BEFORE_CALL_12| v_arrayElimCell_35)) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 4)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))))) is different from true [2022-11-21 16:34:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:28,561 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-21 16:34:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 16:34:28,562 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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 37 [2022-11-21 16:34:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:28,563 INFO L225 Difference]: With dead ends: 64 [2022-11-21 16:34:28,564 INFO L226 Difference]: Without dead ends: 62 [2022-11-21 16:34:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=160, Invalid=1101, Unknown=139, NotChecked=3570, Total=4970 [2022-11-21 16:34:28,566 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:28,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 154 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 406 Unchecked, 0.3s Time] [2022-11-21 16:34:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-21 16:34:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-21 16:34:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 16:34:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-21 16:34:28,584 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 37 [2022-11-21 16:34:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:28,585 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-21 16:34:28,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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 16:34:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-21 16:34:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:34:28,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:28,586 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:34:28,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:28,793 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:34:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-21 16:34:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685414913] [2022-11-21 16:34:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:30,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:34:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:34:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:34:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:34:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685414913] [2022-11-21 16:34:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685414913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:30,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971917493] [2022-11-21 16:34:30,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:34:30,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:30,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:30,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:30,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:34:30,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:34:30,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:34:30,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-21 16:34:30,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:31,042 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 16:34:31,568 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:34:31,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:34:31,700 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 16:34:31,720 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 16:34:31,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:34:31,904 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 56 treesize of output 38 [2022-11-21 16:34:31,915 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 27 treesize of output 22 [2022-11-21 16:34:32,217 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-21 16:34:32,218 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 50 [2022-11-21 16:34:32,231 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:34:32,232 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 30 treesize of output 13 [2022-11-21 16:34:32,370 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_984 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_984))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_985 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_985) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-21 16:34:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:32,440 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-21 16:34:32,441 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 114 treesize of output 102 [2022-11-21 16:34:32,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:32,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:32,471 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-21 16:34:32,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 111 [2022-11-21 16:34:32,512 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-21 16:34:32,513 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 32 treesize of output 34 [2022-11-21 16:34:32,978 INFO L321 Elim1Store]: treesize reduction 74, result has 3.9 percent of original size [2022-11-21 16:34:32,978 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 83 [2022-11-21 16:34:33,106 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2022-11-21 16:34:33,107 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 30 [2022-11-21 16:34:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 16:34:33,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:34:33,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_16| Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_16|) 0)) (not (< |v_node_create_~temp~0#1.base_16| |c_#StackHeapBarrier|)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_16| v_ArrVal_990))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_16| v_ArrVal_991))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select .cse1 .cse0) .cse5)) (.cse3 (select (select .cse4 .cse0) .cse5))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))))) is different from false [2022-11-21 16:34:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971917493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:33,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:34:33,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2022-11-21 16:34:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355596061] [2022-11-21 16:34:33,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-21 16:34:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-21 16:34:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1589, Unknown=2, NotChecked=162, Total=1892 [2022-11-21 16:34:33,551 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 32 states have internal predecessors, (59), 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 16:34:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:36,449 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-11-21 16:34:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:34:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 32 states have internal predecessors, (59), 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 39 [2022-11-21 16:34:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:36,451 INFO L225 Difference]: With dead ends: 82 [2022-11-21 16:34:36,451 INFO L226 Difference]: Without dead ends: 71 [2022-11-21 16:34:36,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=267, Invalid=2289, Unknown=2, NotChecked=198, Total=2756 [2022-11-21 16:34:36,453 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 133 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:36,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 277 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 593 Invalid, 0 Unknown, 56 Unchecked, 1.1s Time] [2022-11-21 16:34:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-21 16:34:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2022-11-21 16:34:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 16:34:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-21 16:34:36,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 39 [2022-11-21 16:34:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:36,477 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-21 16:34:36,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 32 states have internal predecessors, (59), 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 16:34:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-21 16:34:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:34:36,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:36,479 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:34:36,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:36,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:36,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:34:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-21 16:34:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045589955] [2022-11-21 16:34:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:38,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:34:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:34:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:34:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:34:39,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:39,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045589955] [2022-11-21 16:34:39,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045589955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:39,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622339487] [2022-11-21 16:34:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:39,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:39,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:39,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ba683dc-040f-4e5b-838b-871b1e25d3ac/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:34:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:39,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-21 16:34:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:40,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:34:40,698 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 18 treesize of output 10 [2022-11-21 16:34:40,705 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 16:34:41,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:41,050 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 16:34:41,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:41,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:41,063 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 34 treesize of output 33 [2022-11-21 16:34:41,087 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:34:41,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 16:34:42,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:42,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:42,864 INFO L321 Elim1Store]: treesize reduction 281, result has 24.7 percent of original size [2022-11-21 16:34:42,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 388 treesize of output 413 [2022-11-21 16:34:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:42,988 INFO L321 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2022-11-21 16:34:42,989 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 38 [2022-11-21 16:34:43,035 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 10 treesize of output 9 [2022-11-21 16:34:43,189 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 46 treesize of output 38 [2022-11-21 16:34:43,407 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 16:34:43,465 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 8 treesize of output 7 [2022-11-21 16:34:43,546 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-21 16:34:43,547 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 51 [2022-11-21 16:34:46,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:46,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:46,300 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 0 case distinctions, treesize of input 314 treesize of output 236 [2022-11-21 16:34:46,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-21 16:34:46,355 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 16:34:46,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:46,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:36:55,384 WARN L233 SmtUtils]: Spent 2.15m on a formula simplification. DAG size of input: 653 DAG size of output: 123 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 16:36:55,385 INFO L321 Elim1Store]: treesize reduction 3509, result has 7.8 percent of original size [2022-11-21 16:36:55,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 110 case distinctions, treesize of input 909123 treesize of output 888761 [2022-11-21 16:40:08,709 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 16:40:09,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-21 16:40:10,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:41:09,210 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 16:41:10,228 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 10 treesize of output 3 [2022-11-21 16:41:10,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:41:12,462 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 16:41:13,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:41:14,694 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 16:41:15,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:46:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:55,916 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:46:55,916 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:46:57,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:58,056 INFO L217 Elim1Store]: Index analysis took 172 ms [2022-11-21 16:46:58,289 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:46:58,289 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:46:58,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:58,647 INFO L217 Elim1Store]: Index analysis took 154 ms [2022-11-21 16:46:58,900 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:46:58,900 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:00,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:00,732 INFO L321 Elim1Store]: treesize reduction 77, result has 6.1 percent of original size [2022-11-21 16:47:00,732 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:00,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:01,023 INFO L217 Elim1Store]: Index analysis took 118 ms [2022-11-21 16:47:01,387 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:01,387 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:03,112 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:47:03,113 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:04,978 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:04,978 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:05,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:05,617 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:05,617 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:06,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:06,365 INFO L321 Elim1Store]: treesize reduction 77, result has 6.1 percent of original size [2022-11-21 16:47:06,365 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:06,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:07,129 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:07,129 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:07,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:07,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:07,620 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:07,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:08,848 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:47:08,849 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:09,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:09,818 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:09,819 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:10,122 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:10,122 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:12,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:12,634 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:47:12,635 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:13,582 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:47:13,582 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:14,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:14,852 INFO L321 Elim1Store]: treesize reduction 77, result has 6.1 percent of original size [2022-11-21 16:47:14,852 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:47:15,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:15,185 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:47:15,185 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:22,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:22,473 INFO L217 Elim1Store]: Index analysis took 117 ms [2022-11-21 16:48:22,863 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:48:22,864 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:24,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:24,979 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:48:24,979 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:25,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:25,554 INFO L321 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2022-11-21 16:48:25,555 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:26,292 INFO L217 Elim1Store]: Index analysis took 105 ms [2022-11-21 16:48:26,663 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:48:26,664 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:28,604 INFO L321 Elim1Store]: treesize reduction 77, result has 6.1 percent of original size [2022-11-21 16:48:28,605 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 130 treesize of output 28 [2022-11-21 16:48:28,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:29,041 INFO L321 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2022-11-21 16:48:29,041 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 28