./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/config/KojakReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b995352c2aa614292d7ca8e2ab060aead2140bac61fbd718d54a02f08e13c4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 03:04:40,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 03:04:40,456 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-19 03:04:40,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 03:04:40,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-19 03:04:40,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 03:04:40,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 03:04:40,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-19 03:04:40,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 03:04:40,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 03:04:40,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 03:04:40,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 03:04:40,525 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 03:04:40,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 03:04:40,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 03:04:40,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 03:04:40,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 03:04:40,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 03:04:40,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 03:04:40,529 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 03:04:40,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 03:04:40,531 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 03:04:40,531 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-19 03:04:40,532 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-19 03:04:40,532 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-19 03:04:40,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 03:04:40,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:04:40,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 03:04:40,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 03:04:40,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 03:04:40,537 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-19 03:04:40,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 03:04:40,537 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 03:04:40,538 INFO L153 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_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/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_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Kojak 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 -> e4b995352c2aa614292d7ca8e2ab060aead2140bac61fbd718d54a02f08e13c4 [2023-11-19 03:04:40,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 03:04:40,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 03:04:40,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 03:04:40,878 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 03:04:40,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 03:04:40,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c [2023-11-19 03:04:44,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 03:04:44,262 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 03:04:44,265 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c [2023-11-19 03:04:44,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/data/6de426410/26f2227045454dd88097ab0d43fd6594/FLAGb9d22fc77 [2023-11-19 03:04:44,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/data/6de426410/26f2227045454dd88097ab0d43fd6594 [2023-11-19 03:04:44,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 03:04:44,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 03:04:44,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 03:04:44,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 03:04:44,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 03:04:44,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bea2f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44, skipping insertion in model container [2023-11-19 03:04:44,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 03:04:44,479 WARN L240 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_8a2b4d8a-b852-4ee7-8493-488999f72db8/sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c[987,1000] [2023-11-19 03:04:44,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:04:44,516 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 03:04:44,526 WARN L240 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_8a2b4d8a-b852-4ee7-8493-488999f72db8/sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c[987,1000] [2023-11-19 03:04:44,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:04:44,552 INFO L206 MainTranslator]: Completed translation [2023-11-19 03:04:44,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44 WrapperNode [2023-11-19 03:04:44,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 03:04:44,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 03:04:44,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 03:04:44,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 03:04:44,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,592 INFO L138 Inliner]: procedures = 16, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-11-19 03:04:44,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 03:04:44,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 03:04:44,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 03:04:44,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 03:04:44,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 03:04:44,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 03:04:44,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 03:04:44,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 03:04:44,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:04:44" (1/1) ... [2023-11-19 03:04:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:04:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/z3 [2023-11-19 03:04:44,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-19 03:04:44,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a2b4d8a-b852-4ee7-8493-488999f72db8/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-19 03:04:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 03:04:44,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 03:04:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2023-11-19 03:04:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2023-11-19 03:04:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-19 03:04:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-19 03:04:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 03:04:44,782 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 03:04:44,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 03:04:45,112 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 03:04:45,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 03:04:45,167 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 03:04:45,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:04:45 BoogieIcfgContainer [2023-11-19 03:04:45,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 03:04:45,173 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-19 03:04:45,173 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-19 03:04:45,184 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-19 03:04:45,184 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:04:45" (1/1) ... [2023-11-19 03:04:45,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 03:04:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:04:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 20 states and 24 transitions. [2023-11-19 03:04:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-19 03:04:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:04:45,279 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:04:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:04:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:04:45,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 03:04:45,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:04:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:45,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:45,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:46,040 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2023-11-19 03:04:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2023-11-19 03:04:46,136 INFO L378 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 17 treesize of output 15 [2023-11-19 03:04:46,217 INFO L378 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 17 treesize of output 15 [2023-11-19 03:04:46,305 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 03:04:46,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 86 [2023-11-19 03:04:46,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:46,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:46,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:47,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 227 [2023-11-19 03:04:47,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,421 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2023-11-19 03:04:47,560 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 59 [2023-11-19 03:04:47,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 03:04:47,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:47,782 INFO L349 Elim1Store]: treesize reduction 63, result has 11.3 percent of original size [2023-11-19 03:04:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 142 [2023-11-19 03:04:48,110 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:48,113 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2023-11-19 03:04:48,151 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:48,155 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2023-11-19 03:04:48,197 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:48,199 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 134 [2023-11-19 03:04:48,236 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:48,238 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161 [2023-11-19 03:04:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:48,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:48,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 369 [2023-11-19 03:04:49,013 INFO L378 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 83 treesize of output 81 [2023-11-19 03:04:49,041 INFO L349 Elim1Store]: treesize reduction 11, result has 50.0 percent of original size [2023-11-19 03:04:49,041 INFO L378 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 2 case distinctions, treesize of input 81 treesize of output 88 [2023-11-19 03:04:49,066 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:49,067 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-11-19 03:04:49,194 INFO L378 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 44 treesize of output 38 [2023-11-19 03:04:49,203 INFO L378 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 36 [2023-11-19 03:04:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:04:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:04:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 26 states and 39 transitions. [2023-11-19 03:04:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2023-11-19 03:04:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:04:49,979 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:04:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:04:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:04:50,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-19 03:04:50,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:04:50,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,111 INFO L349 Elim1Store]: treesize reduction 73, result has 12.0 percent of original size [2023-11-19 03:04:50,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 94 [2023-11-19 03:04:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-19 03:04:50,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,163 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-11-19 03:04:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 81 [2023-11-19 03:04:50,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,214 INFO L349 Elim1Store]: treesize reduction 44, result has 24.1 percent of original size [2023-11-19 03:04:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 82 [2023-11-19 03:04:50,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,250 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2023-11-19 03:04:50,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 45 [2023-11-19 03:04:50,266 INFO L378 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 31 treesize of output 28 [2023-11-19 03:04:50,291 INFO L378 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 [2023-11-19 03:04:50,321 INFO L378 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 [2023-11-19 03:04:50,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,353 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-11-19 03:04:50,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 22 [2023-11-19 03:04:50,363 INFO L378 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 26 treesize of output 24 [2023-11-19 03:04:50,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2023-11-19 03:04:50,393 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:50,394 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2023-11-19 03:04:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2023-11-19 03:04:50,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,418 INFO L378 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 59 treesize of output 15 [2023-11-19 03:04:50,426 INFO L378 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 26 treesize of output 24 [2023-11-19 03:04:50,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,458 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-11-19 03:04:50,458 INFO L378 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 1 case distinctions, treesize of input 59 treesize of output 22 [2023-11-19 03:04:50,467 INFO L378 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 26 treesize of output 24 [2023-11-19 03:04:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,516 INFO L349 Elim1Store]: treesize reduction 73, result has 12.0 percent of original size [2023-11-19 03:04:50,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 89 [2023-11-19 03:04:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,568 INFO L349 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2023-11-19 03:04:50,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 88 [2023-11-19 03:04:50,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,621 INFO L349 Elim1Store]: treesize reduction 52, result has 21.2 percent of original size [2023-11-19 03:04:50,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 76 [2023-11-19 03:04:50,629 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:50,630 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2023-11-19 03:04:50,642 INFO L378 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 1 [2023-11-19 03:04:50,644 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-19 03:04:50,680 INFO L378 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 85 treesize of output 80 [2023-11-19 03:04:50,721 INFO L378 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 146 treesize of output 139 [2023-11-19 03:04:50,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:50,862 INFO L349 Elim1Store]: treesize reduction 94, result has 18.3 percent of original size [2023-11-19 03:04:50,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 158 [2023-11-19 03:04:50,879 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:50,881 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 197 [2023-11-19 03:04:50,897 INFO L378 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 26 treesize of output 24 [2023-11-19 03:04:50,910 INFO L378 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 1 [2023-11-19 03:04:50,957 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:50,963 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2023-11-19 03:04:51,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:51,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:51,027 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-19 03:04:51,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 173 [2023-11-19 03:04:51,036 INFO L378 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 [2023-11-19 03:04:51,069 INFO L378 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 [2023-11-19 03:04:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-19 03:04:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:04:53,535 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (and (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse1 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_10) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse6)) (.cse5 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_1) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse6))) (let ((.cse3 (select .cse5 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (.cse0 (select .cse5 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse4 (select .cse1 |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (and (= .cse0 (select .cse1 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= .cse2 .cse3) (= (select .cse3 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse0 (store (store .cse4 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse0 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_4) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse10))) (let ((.cse9 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_7) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse10)) (.cse7 (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= .cse7 (store (store .cse2 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse7 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (= (select (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse2 (select .cse9 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse9 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) .cse7))))))) (= (select .cse2 0) 0) (= |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0) (= (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base|) 0) 0) (= 0 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)))) is different from false [2023-11-19 03:04:53,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= (select .cse0 0) 0) (= (select .cse1 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse1 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) (= c_func_to_recursive_line_26_to_34_0_~x.offset 0) (not (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base)) (let ((.cse2 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (or (and (= (select .cse0 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) .cse2 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse6))) (let ((.cse3 (select .cse4 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse5 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse6))) (and (= (store (store .cse0 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse3 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse3) (= (select (select .cse4 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse5 c_func_to_recursive_line_26_to_34_0_~y.base) .cse3) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.base) .cse0))))))) (and .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse12)) (.cse11 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse12))) (let ((.cse7 (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse8 (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse9 (select .cse11 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse7 .cse0) (= (select .cse8 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse9 (select .cse10 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse8 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse9))))))))))))) is different from false [2023-11-19 03:04:54,137 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= (select .cse0 0) 0) (= (select .cse1 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse1 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) (= c_func_to_recursive_line_26_to_34_0_~x.offset 0) (not (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base)) (let ((.cse2 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (or (and (= (select .cse0 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) .cse2 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse6))) (let ((.cse3 (select .cse4 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse5 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse6))) (and (= (store (store .cse0 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse3 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse3) (= (select (select .cse4 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse5 c_func_to_recursive_line_26_to_34_0_~y.base) .cse3) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.base) .cse0))))))) (and .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse12)) (.cse11 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse12))) (let ((.cse7 (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse8 (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse9 (select .cse11 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse7 .cse0) (= (select .cse8 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse9 (select .cse10 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse8 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse9)))))))))))))) is different from true [2023-11-19 03:04:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:04:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 47 transitions. [2023-11-19 03:04:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2023-11-19 03:04:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:04:54,968 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:04:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:04:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:04:55,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-19 03:04:55,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:04:55,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2023-11-19 03:04:55,104 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:55,105 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2023-11-19 03:04:55,117 INFO L378 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 50 treesize of output 48 [2023-11-19 03:04:55,126 INFO L378 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 1 [2023-11-19 03:04:55,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,163 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-19 03:04:55,163 INFO L378 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 1 case distinctions, treesize of input 38 treesize of output 34 [2023-11-19 03:04:55,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-19 03:04:55,177 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 03:04:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 03:04:55,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2023-11-19 03:04:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2023-11-19 03:04:55,227 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:55,228 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2023-11-19 03:04:55,241 INFO L378 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 136 treesize of output 129 [2023-11-19 03:04:55,249 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 03:04:55,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:55,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2023-11-19 03:04:55,268 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:55,269 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2023-11-19 03:04:55,276 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 03:04:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:04:55,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse9 (= (select .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|))) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|) |c_ULTIMATE.start_main_~#y~0#1.offset|) 0))) (and (not (and .cse0 (or (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse8)) (.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse2 (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse5 .cse4) (= .cse2 (store (store .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))))) (and .cse9 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse13))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse13)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse11) (= (select (select .cse12 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse10 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse5) (= (store (store .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse11 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse11) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse1)))) .cse9 .cse0 .cse1))) is different from false [2023-11-19 03:04:55,881 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse9 (= (select .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|))) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|) |c_ULTIMATE.start_main_~#y~0#1.offset|) 0))) (and (not (and .cse0 (or (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse8)) (.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse2 (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse5 .cse4) (= .cse2 (store (store .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))))) (and .cse9 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse13))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse13)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse11) (= (select (select .cse12 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse10 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse5) (= (store (store .cse5 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse11 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse11) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse1)))) .cse9 .cse0 .cse1)))) is different from true [2023-11-19 03:04:56,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse0 (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base))) (.cse3 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset) 0)) (.cse4 (= (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (and .cse0 (= (select .cse1 0) 0) (= (select .cse2 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse2 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) .cse3 (= c_func_to_recursive_line_26_to_34_0_~x.offset 0) .cse4 (not (and .cse0 (or (and .cse3 .cse4 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse5 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse7 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (and (= (store (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse5) (= (select (select .cse6 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.base) .cse5) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.base) .cse1))))))) (and .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse13 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse9 (select .cse13 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse10 (select .cse12 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse11 (select .cse13 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse9 .cse1) (= (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse11 (select .cse12 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse11))))))))))))) is different from false [2023-11-19 03:04:56,275 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse0 (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base))) (.cse3 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset) 0)) (.cse4 (= (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (and .cse0 (= (select .cse1 0) 0) (= (select .cse2 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse2 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) .cse3 (= c_func_to_recursive_line_26_to_34_0_~x.offset 0) .cse4 (not (and .cse0 (or (and .cse3 .cse4 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse5 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse7 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (and (= (store (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse5) (= (select (select .cse6 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.base) .cse5) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.base) .cse1))))))) (and .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse13 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse9 (select .cse13 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse10 (select .cse12 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse11 (select .cse13 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse9 .cse1) (= (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse11 (select .cse12 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse11)))))))))))))) is different from true [2023-11-19 03:04:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:04:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 30 states and 52 transitions. [2023-11-19 03:04:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2023-11-19 03:04:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:04:56,844 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:04:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:04:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:04:56,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-19 03:04:56,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:04:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:56,963 INFO L349 Elim1Store]: treesize reduction 40, result has 35.5 percent of original size [2023-11-19 03:04:56,963 INFO L378 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 1 case distinctions, treesize of input 64 treesize of output 45 [2023-11-19 03:04:56,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:56,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:56,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:56,996 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-11-19 03:04:56,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2023-11-19 03:04:57,014 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 03:04:57,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 100 [2023-11-19 03:04:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:04:57,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (let ((.cse1 (= (select .cse5 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0)) (.cse2 (= (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) 0)) (.cse0 (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)))) (and .cse0 .cse1 .cse2 (not (and (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_10) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse9)) (.cse8 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_1) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse9))) (let ((.cse6 (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (.cse3 (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse7 (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (and (= .cse3 (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= .cse5 .cse6) (= (select .cse6 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse3 (store (store .cse7 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse3 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= (select .cse7 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse2) (and .cse1 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse11 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_4) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse13))) (let ((.cse12 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_7) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse13)) (.cse10 (select .cse11 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= .cse10 (store (store .cse5 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse10 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (= (select (select .cse11 |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse5 (select .cse12 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse12 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) .cse10)))))) .cse2)) .cse0))))) is different from false [2023-11-19 03:04:57,121 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (let ((.cse1 (= (select .cse5 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0)) (.cse2 (= (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) 0)) (.cse0 (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)))) (and .cse0 .cse1 .cse2 (not (and (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_10) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse9)) (.cse8 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_1) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse9))) (let ((.cse6 (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (.cse3 (select .cse8 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse7 (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~x.base|))) (and (= .cse3 (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= .cse5 .cse6) (= (select .cse6 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse3 (store (store .cse7 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse3 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= (select .cse7 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse2) (and .cse1 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse11 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_4) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse13))) (let ((.cse12 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_7) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse13)) (.cse10 (select .cse11 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= .cse10 (store (store .cse5 |c_func_to_recursive_line_26_to_34_0_#in~x.offset| (select .cse10 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) |c_func_to_recursive_line_26_to_34_0_#in~y.offset| 0)) (= (select (select .cse11 |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 0) (= .cse5 (select .cse12 |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (not (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse12 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) .cse10)))))) .cse2)) .cse0)))))) is different from true [2023-11-19 03:04:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:04:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 31 states and 57 transitions. [2023-11-19 03:04:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 57 transitions. [2023-11-19 03:04:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:04:57,165 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:04:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:04:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:04:57,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-19 03:04:57,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:04:57,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:57,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:57,486 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2023-11-19 03:04:57,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2023-11-19 03:04:57,546 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 03:04:57,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 134 [2023-11-19 03:04:57,584 INFO L378 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 17 treesize of output 15 [2023-11-19 03:04:57,612 INFO L378 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 17 treesize of output 15 [2023-11-19 03:04:57,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:57,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:04:58,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 274 [2023-11-19 03:04:58,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,384 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:04:58,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 232 [2023-11-19 03:04:58,513 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:58,516 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 259 [2023-11-19 03:04:58,633 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:58,633 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2023-11-19 03:04:58,949 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:58,950 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 330 [2023-11-19 03:04:59,104 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:59,104 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 109 [2023-11-19 03:04:59,136 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:04:59,137 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 109 [2023-11-19 03:04:59,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:59,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:59,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:04:59,452 INFO L349 Elim1Store]: treesize reduction 251, result has 16.6 percent of original size [2023-11-19 03:04:59,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1194 treesize of output 1327 [2023-11-19 03:04:59,520 INFO L378 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 533 treesize of output 531 [2023-11-19 03:05:00,894 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:00,895 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-11-19 03:05:01,037 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:01,037 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-11-19 03:05:01,262 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:01,262 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2023-11-19 03:05:01,332 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:01,332 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2023-11-19 03:05:03,122 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:03,122 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2023-11-19 03:05:03,284 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:03,284 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2023-11-19 03:05:03,693 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,698 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,700 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,762 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,764 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,825 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:03,827 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,188 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,193 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,195 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,254 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,256 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,298 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:04,299 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-19 03:05:05,936 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:05,937 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,012 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,013 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,071 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,072 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 195 [2023-11-19 03:05:06,114 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,115 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,152 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,152 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,186 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,187 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,235 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,235 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,265 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,265 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,314 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,315 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,402 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,403 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,448 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,449 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,527 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,528 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 439 [2023-11-19 03:05:06,586 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,586 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 162 [2023-11-19 03:05:06,635 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,636 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,692 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,693 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,776 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,777 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2023-11-19 03:05:06,819 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,820 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:06,879 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:06,879 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-11-19 03:05:07,035 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,035 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,182 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,182 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,207 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,207 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,255 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,256 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2023-11-19 03:05:07,306 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,307 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 129 [2023-11-19 03:05:07,509 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,510 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2023-11-19 03:05:07,546 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,547 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,594 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,595 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,650 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,651 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,745 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,746 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,777 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,779 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 171 [2023-11-19 03:05:07,836 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,837 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2023-11-19 03:05:07,917 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,918 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2023-11-19 03:05:07,978 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:07,980 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 352 [2023-11-19 03:05:08,095 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,099 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 996 [2023-11-19 03:05:08,246 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,247 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 190 [2023-11-19 03:05:08,360 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,361 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2023-11-19 03:05:08,391 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,393 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 336 [2023-11-19 03:05:08,478 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,479 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 190 [2023-11-19 03:05:08,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:08,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:08,721 INFO L349 Elim1Store]: treesize reduction 86, result has 21.1 percent of original size [2023-11-19 03:05:08,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 6390 treesize of output 6416 [2023-11-19 03:05:08,852 INFO L349 Elim1Store]: treesize reduction 57, result has 17.4 percent of original size [2023-11-19 03:05:08,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 319 treesize of output 307 [2023-11-19 03:05:08,945 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:08,946 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2023-11-19 03:05:09,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,075 INFO L378 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 93 treesize of output 98 [2023-11-19 03:05:09,090 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:09,091 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 163 [2023-11-19 03:05:09,139 INFO L378 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 26 treesize of output 5 [2023-11-19 03:05:09,165 INFO L378 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 26 treesize of output 5 [2023-11-19 03:05:09,203 INFO L349 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2023-11-19 03:05:09,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 21 [2023-11-19 03:05:09,249 INFO L378 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 26 treesize of output 5 [2023-11-19 03:05:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,276 INFO L378 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 105 treesize of output 110 [2023-11-19 03:05:09,302 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:09,303 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 258 [2023-11-19 03:05:09,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,392 INFO L349 Elim1Store]: treesize reduction 63, result has 20.3 percent of original size [2023-11-19 03:05:09,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 282 [2023-11-19 03:05:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,487 INFO L378 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 100 treesize of output 105 [2023-11-19 03:05:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:09,696 INFO L349 Elim1Store]: treesize reduction 93, result has 23.1 percent of original size [2023-11-19 03:05:09,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25821 treesize of output 23844 [2023-11-19 03:05:10,205 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-11-19 03:05:10,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 33 [2023-11-19 03:05:10,219 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,220 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2023-11-19 03:05:10,397 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,397 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-19 03:05:10,406 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,406 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161 [2023-11-19 03:05:10,421 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,422 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2023-11-19 03:05:10,437 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,438 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 330 [2023-11-19 03:05:10,473 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,474 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2023-11-19 03:05:10,494 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:10,497 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 442 [2023-11-19 03:05:10,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 03:05:10,951 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 03:05:10,951 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 11 [2023-11-19 03:05:10,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 03:05:10,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:10,973 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 03:05:10,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 1 [2023-11-19 03:05:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:05:11,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse0 (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base))) (.cse3 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset) 0)) (.cse4 (= (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (and .cse0 (not (and (= (select .cse1 0) 0) (= (select .cse2 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse2 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) (= c_func_to_recursive_line_26_to_34_0_~x.offset 0))) .cse3 .cse4 (not (and .cse0 (or (and .cse3 .cse4 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse5 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse7 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (and (= (store (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse5) (= (select (select .cse6 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.base) .cse5) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.base) .cse1))))))) (and .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse13 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse9 (select .cse13 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse10 (select .cse12 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse11 (select .cse13 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse9 .cse1) (= (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse11 (select .cse12 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse11))))))))))))) is different from false [2023-11-19 03:05:11,783 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse1 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse0 (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base))) (.cse3 (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset) 0)) (.cse4 (= (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (and .cse0 (not (and (= (select .cse1 0) 0) (= (select .cse2 0) 0) (= c_func_to_recursive_line_26_to_34_0_~y.offset 0) (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|) 0) 0))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse2 0 0) (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))))) (= c_func_to_recursive_line_26_to_34_0_~x.offset 0))) .cse3 .cse4 (not (and .cse0 (or (and .cse3 .cse4 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_4) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (let ((.cse5 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse7 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_7) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse8))) (and (= (store (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse5) (= (select (select .cse6 c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.base) .cse5) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.base) .cse1))))))) (and .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_10) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse13 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_1) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse9 (select .cse13 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse10 (select .cse12 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse11 (select .cse13 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse9 .cse1) (= (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse11 (select .cse12 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (store (store .cse10 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse11)))))))))))))) is different from true [2023-11-19 03:05:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:05:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 33 states and 65 transitions. [2023-11-19 03:05:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 65 transitions. [2023-11-19 03:05:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 03:05:12,475 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:05:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:05:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:05:12,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-19 03:05:12,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 03:05:12,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:12,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:12,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:12,763 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2023-11-19 03:05:12,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2023-11-19 03:05:12,803 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 03:05:12,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2023-11-19 03:05:12,836 INFO L378 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 17 treesize of output 15 [2023-11-19 03:05:12,866 INFO L378 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 17 treesize of output 15 [2023-11-19 03:05:13,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:05:13,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:05:13,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2023-11-19 03:05:13,552 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:13,554 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 225 [2023-11-19 03:05:13,643 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:13,648 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 431 [2023-11-19 03:05:13,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:14,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 03:05:14,063 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-19 03:05:14,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 302 [2023-11-19 03:05:14,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 03:05:14,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:14,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 03:05:14,572 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2023-11-19 03:05:14,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 98 [2023-11-19 03:05:14,714 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:14,717 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 413 [2023-11-19 03:05:15,001 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:15,005 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 148 [2023-11-19 03:05:15,036 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:15,038 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 329 [2023-11-19 03:05:15,121 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:15,123 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 594 [2023-11-19 03:05:15,939 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse5 (= (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0))) (or (and .cse0 (exists ((v_DerPreprocessor_216 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_217 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_216) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_217) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse1 .cse2) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= (store (store .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse3)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))) .cse5) (and .cse0 (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_213 (Array Int Int)) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_DerPreprocessor_212 (Array Int Int)) (v_DerPreprocessor_208 (Array Int Int)) (v_DerPreprocessor_209 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_208) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_209) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_212) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_213) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse6 (select .cse13 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse6 .cse7) (= (select .cse8 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse9) (= (select .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse10) (= (select .cse9 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= .cse6 (store (store .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= .cse11 .cse1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (exists ((v_prenex_239 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int)) (v_prenex_237 (Array Int Int))) (let ((.cse22 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_239) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_237) |ULTIMATE.start_main_~#c~0#1.base| .cse22)) (.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_231) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_232) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse15 (select .cse20 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse17 (select .cse19 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse18 (store .cse16 |c_ULTIMATE.start_main_~#x~0#1.offset| 0))) (and (= (select .cse15 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (store .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse7) (= .cse16 .cse17) (= (select .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (= .cse15 .cse1) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse18 (select .cse19 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= .cse17 (select .cse20 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse18) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))))))) (and (or (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse24 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse25 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse24))) (let ((.cse23 (select .cse25 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse23 .cse24) (= (select .cse25 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse23 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse23) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse23 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse25 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse23) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse27 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse28 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse27))) (let ((.cse26 (select .cse28 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse26 .cse27) (= (select .cse28 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse26 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse26) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse26 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse28 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse26) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse29 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse30 (select .cse29 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse30 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse30) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse30 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse29 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse30) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse31 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse32 (select .cse31 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse31 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse32 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse32) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse32 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse31 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse32) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and (exists ((v_DerPreprocessor_220 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_221 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#k~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= .cse33 (store (store .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse33 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0))) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))) .cse0)) (= (select .cse1 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) .cse5)))) is different from true [2023-11-19 03:05:18,500 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse0 (not (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base))) (.cse9 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse32 (= (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.offset) 0))) (or (and .cse0 (or (exists ((v_prenex_239 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int)) (v_prenex_237 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_224) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse10))) (let ((.cse7 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_231) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_232) |ULTIMATE.start_main_~#c~0#1.base| .cse10)) (.cse5 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_239) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_237) |ULTIMATE.start_main_~#c~0#1.base| .cse10)) (.cse1 (select .cse4 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse3 (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.offset 0)) (.cse2 (select .cse5 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse8 (select .cse7 c_func_to_recursive_line_26_to_34_0_~x.base))) (and (= .cse1 .cse2) (= (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset) 0) (= .cse3 (select .cse4 c_func_to_recursive_line_26_to_34_0_~x.base)) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= .cse3 (select .cse5 c_func_to_recursive_line_26_to_34_0_~x.base)) (= (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse6) (= (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.base) .cse2) (= (select .cse8 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= .cse8 .cse9))))))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_213 (Array Int Int)) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_DerPreprocessor_212 (Array Int Int)) (v_DerPreprocessor_208 (Array Int Int)) (v_DerPreprocessor_209 (Array Int Int))) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse16 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_224) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse18)) (.cse17 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_208) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_209) |ULTIMATE.start_main_~#c~0#1.base| .cse18))) (let ((.cse14 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_212) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_213) |ULTIMATE.start_main_~#c~0#1.base| .cse18)) (.cse15 (select .cse17 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse13 (select .cse17 c_func_to_recursive_line_26_to_34_0_~x.base)) (.cse12 (select .cse16 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse11 (select .cse16 c_func_to_recursive_line_26_to_34_0_~x.base))) (and (= (store (store .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse12 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0) .cse12) (= .cse13 .cse9) (= (select .cse14 c_func_to_recursive_line_26_to_34_0_~y.base) .cse15) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse11 (select .cse14 c_func_to_recursive_line_26_to_34_0_~x.base)) (= (select .cse15 c_func_to_recursive_line_26_to_34_0_~y.offset) 0) (= (select .cse13 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (= .cse6 .cse12) (= (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base))))))))) (and (or (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse20 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse21 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_220) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse20))) (let ((.cse19 (select .cse21 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse19) (= .cse19 .cse20) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse21 c_func_to_recursive_line_26_to_34_0_~y.base) (store .cse19 c_func_to_recursive_line_26_to_34_0_~y.offset 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= v_DerPreprocessor_219 .cse19) (= (store .cse19 c_func_to_recursive_line_26_to_34_0_~x.offset 0) (select .cse21 c_func_to_recursive_line_26_to_34_0_~x.base)))))))) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse23 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse24 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_220) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse23))) (let ((.cse22 (select .cse24 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse22) (= .cse22 .cse23) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse24 c_func_to_recursive_line_26_to_34_0_~y.base) (store .cse22 c_func_to_recursive_line_26_to_34_0_~y.offset 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= v_DerPreprocessor_219 .cse22) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse22 c_func_to_recursive_line_26_to_34_0_~x.offset 0) (select .cse24 c_func_to_recursive_line_26_to_34_0_~x.base)))))))) (and .cse0 (exists ((v_DerPreprocessor_220 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_221 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_220) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_221) |ULTIMATE.start_main_~#k~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)))) (let ((.cse25 (select .cse27 c_func_to_recursive_line_26_to_34_0_~x.base))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~x.base)) (= (select .cse25 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (let ((.cse26 (select .cse27 c_func_to_recursive_line_26_to_34_0_~y.base))) (= .cse26 (store (store .cse25 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse26 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0)))))))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse29 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_220) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse28 (select .cse29 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse28) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse29 c_func_to_recursive_line_26_to_34_0_~y.base) (store .cse28 c_func_to_recursive_line_26_to_34_0_~y.offset 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= v_DerPreprocessor_219 .cse28) (= (store .cse28 c_func_to_recursive_line_26_to_34_0_~x.offset 0) (select .cse29 c_func_to_recursive_line_26_to_34_0_~x.base)))))) .cse0) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse31 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_220) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse30 (select .cse31 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse30) (not (= |ULTIMATE.start_main_~#k~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse31 c_func_to_recursive_line_26_to_34_0_~y.base) (store .cse30 c_func_to_recursive_line_26_to_34_0_~y.offset 0)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)) (= v_DerPreprocessor_219 .cse30) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse30 c_func_to_recursive_line_26_to_34_0_~x.offset 0) (select .cse31 c_func_to_recursive_line_26_to_34_0_~x.base)))))))) (= (select .cse9 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) .cse32) (and .cse0 (exists ((v_DerPreprocessor_216 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_217 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_216) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_217) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse33 (select .cse35 c_func_to_recursive_line_26_to_34_0_~x.base))) (and (= (select .cse33 c_func_to_recursive_line_26_to_34_0_~x.offset) 0) (let ((.cse34 (select .cse35 c_func_to_recursive_line_26_to_34_0_~y.base))) (= .cse34 (store (store .cse33 c_func_to_recursive_line_26_to_34_0_~x.offset (select .cse34 c_func_to_recursive_line_26_to_34_0_~x.offset)) c_func_to_recursive_line_26_to_34_0_~y.offset 0))) (= .cse33 .cse9) (not (= c_func_to_recursive_line_26_to_34_0_~x.base |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#c~0#1.base| c_func_to_recursive_line_26_to_34_0_~y.base)))))) .cse32)))) is different from true [2023-11-19 03:05:21,700 INFO L349 Elim1Store]: treesize reduction 8, result has 98.9 percent of original size [2023-11-19 03:05:21,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 14946 treesize of output 14152 [2023-11-19 03:05:22,352 INFO L349 Elim1Store]: treesize reduction 11, result has 50.0 percent of original size [2023-11-19 03:05:22,353 INFO L378 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 2 case distinctions, treesize of input 794 treesize of output 801 [2023-11-19 03:05:22,694 INFO L378 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 12 treesize of output 9 [2023-11-19 03:05:22,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 03:05:22,789 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-19 03:05:22,789 INFO L378 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 2 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 03:05:23,779 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 03:05:23,780 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-11-19 03:05:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:05:34,107 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse5 (= (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0))) (or (and .cse0 (exists ((v_DerPreprocessor_216 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_217 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_216) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_217) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse1 .cse2) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= (store (store .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse3)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))) .cse5) (and .cse0 (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_213 (Array Int Int)) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_DerPreprocessor_212 (Array Int Int)) (v_DerPreprocessor_208 (Array Int Int)) (v_DerPreprocessor_209 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_208) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_209) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_212) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_213) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse6 (select .cse13 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse6 .cse7) (= (select .cse8 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse9) (= (select .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse10) (= (select .cse9 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= .cse6 (store (store .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= .cse11 .cse1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (exists ((v_prenex_239 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int)) (v_prenex_237 (Array Int Int))) (let ((.cse22 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_239) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_237) |ULTIMATE.start_main_~#c~0#1.base| .cse22)) (.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_231) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_232) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse15 (select .cse20 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse17 (select .cse19 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse18 (store .cse16 |c_ULTIMATE.start_main_~#x~0#1.offset| 0))) (and (= (select .cse15 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (store .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse7) (= .cse16 .cse17) (= (select .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (= .cse15 .cse1) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse18 (select .cse19 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= .cse17 (select .cse20 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse18) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))))))) (and (or (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse24 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse25 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse24))) (let ((.cse23 (select .cse25 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse23 .cse24) (= (select .cse25 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse23 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse23) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse23 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse25 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse23) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse27 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse28 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse27))) (let ((.cse26 (select .cse28 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse26 .cse27) (= (select .cse28 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse26 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse26) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse26 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse28 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse26) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse29 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse30 (select .cse29 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse30 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse30) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse30 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse29 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse30) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse31 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse32 (select .cse31 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse31 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse32 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse32) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse32 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse31 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse32) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and (exists ((v_DerPreprocessor_220 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_221 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#k~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= .cse33 (store (store .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse33 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0))) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))) .cse0)) (= (select .cse1 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) .cse5))))) is different from false [2023-11-19 03:05:34,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse36 (= (select .cse1 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))) (and .cse0 (not (let ((.cse5 (= (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0))) (or (and .cse0 (exists ((v_DerPreprocessor_216 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_217 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_216) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_217) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse1 .cse2) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= (store (store .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse3)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))) .cse5) (and .cse0 (or (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_213 (Array Int Int)) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_DerPreprocessor_212 (Array Int Int)) (v_DerPreprocessor_208 (Array Int Int)) (v_DerPreprocessor_209 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_208) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_209) |ULTIMATE.start_main_~#c~0#1.base| .cse14))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_212) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_213) |ULTIMATE.start_main_~#c~0#1.base| .cse14)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse6 (select .cse13 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse6 .cse7) (= (select .cse8 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse9) (= (select .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse10) (= (select .cse9 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= .cse6 (store (store .cse10 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse6 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= .cse11 .cse1) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (exists ((v_prenex_239 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_224 (Array Int Int)) (v_DerPreprocessor_225 (Array Int Int)) (v_prenex_231 (Array Int Int)) (v_prenex_232 (Array Int Int)) (v_prenex_237 (Array Int Int))) (let ((.cse22 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_224) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_225) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_239) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_237) |ULTIMATE.start_main_~#c~0#1.base| .cse22)) (.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_prenex_231) |c_ULTIMATE.start_main_~#x~0#1.base| v_prenex_232) |ULTIMATE.start_main_~#c~0#1.base| .cse22))) (let ((.cse15 (select .cse20 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse17 (select .cse19 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse18 (store .cse16 |c_ULTIMATE.start_main_~#x~0#1.offset| 0))) (and (= (select .cse15 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= (store .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse7) (= .cse16 .cse17) (= (select .cse16 |c_ULTIMATE.start_main_~#y~0#1.offset|) 0) (= .cse15 .cse1) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse18 (select .cse19 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= .cse17 (select .cse20 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse18) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))))))) (and (or (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse24 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse25 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse24))) (let ((.cse23 (select .cse25 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse23 .cse24) (= (select .cse25 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse23 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse23) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse23 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse25 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse23) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse27 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse28 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| .cse27))) (let ((.cse26 (select .cse28 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse26 .cse27) (= (select .cse28 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse26 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse26) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse26 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse28 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse26) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) .cse0) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse29 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse30 (select .cse29 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse30 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse30) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse30 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse29 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse30) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and .cse0 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_220 (Array Int Int)) (v_DerPreprocessor_221 (Array Int Int)) (v_DerPreprocessor_219 (Array Int Int))) (let ((.cse31 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_219) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse32 (select .cse31 |ULTIMATE.start_main_~#k~0#1.base|))) (and (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse31 |c_ULTIMATE.start_main_~#y~0#1.base|) (store .cse32 |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse32) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (store .cse32 |c_ULTIMATE.start_main_~#x~0#1.offset| 0) (select .cse31 |c_ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_219 .cse32) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|))))))) (and (exists ((v_DerPreprocessor_220 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_221 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_220) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_221) |ULTIMATE.start_main_~#k~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~#y~0#1.base|))) (= .cse33 (store (store .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse33 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0))) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse34 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))) .cse0)) .cse36 .cse5)))) (= |c_ULTIMATE.start_main_~#y~0#1.offset| 0) (= (select .cse7 0) 0) (or (and .cse36 (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse40 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_main_~#c~0#1.base| .cse40))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_main_~#c~0#1.base| .cse40)) (.cse38 (select .cse39 |c_ULTIMATE.start_main_~#y~0#1.base|))) (and (= (select .cse37 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse38) (= (select (select .cse39 |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse37 |c_ULTIMATE.start_main_~#x~0#1.base|) .cse1) (= (store (store .cse1 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse38 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0) .cse38) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse46 (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| .cse46)) (.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#c~0#1.base| .cse46))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_main_~#x~0#1.base|)) (.cse41 (select .cse45 |c_ULTIMATE.start_main_~#y~0#1.base|)) (.cse44 (select .cse42 |c_ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse41 (select .cse42 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse43 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= .cse1 .cse43) (= .cse41 (store (store .cse44 |c_ULTIMATE.start_main_~#x~0#1.offset| (select .cse41 |c_ULTIMATE.start_main_~#x~0#1.offset|)) |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~#x~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse44 |c_ULTIMATE.start_main_~#x~0#1.offset|) 0))))))) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false