./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array1_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/config/KojakReach.xml -i ../../sv-benchmarks/c/array-patterns/array1_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC --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 f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:14:17,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:14:17,161 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-23 20:14:17,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:14:17,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-23 20:14:17,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:14:17,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:14:17,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-23 20:14:17,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:14:17,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:14:17,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:14:17,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:14:17,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:14:17,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:14:17,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:14:17,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:14:17,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:14:17,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:14:17,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:14:17,240 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:14:17,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:14:17,242 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:14:17,243 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-23 20:14:17,243 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-23 20:14:17,244 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-23 20:14:17,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:14:17,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-23 20:14:17,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:14:17,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:14:17,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:14:17,249 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-23 20:14:17,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:14:17,250 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:14:17,250 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_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/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_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC 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 -> f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 [2023-11-23 20:14:17,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:14:17,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:14:17,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:14:17,679 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:14:17,679 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:14:17,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/../../sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-23 20:14:20,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:14:21,143 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:14:21,144 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-23 20:14:21,152 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/data/46f5a51d4/6fdb942622a943ad8f85967e11b3425d/FLAG4a0e5dc4f [2023-11-23 20:14:21,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/data/46f5a51d4/6fdb942622a943ad8f85967e11b3425d [2023-11-23 20:14:21,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:14:21,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:14:21,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:14:21,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:14:21,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:14:21,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0652df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21, skipping insertion in model container [2023-11-23 20:14:21,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,207 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:14:21,361 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_517dfd18-dd7b-45a3-9364-545143b9c176/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-23 20:14:21,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:14:21,393 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:14:21,403 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_517dfd18-dd7b-45a3-9364-545143b9c176/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-23 20:14:21,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:14:21,430 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:14:21,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21 WrapperNode [2023-11-23 20:14:21,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:14:21,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:14:21,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:14:21,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:14:21,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,476 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-11-23 20:14:21,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:14:21,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:14:21,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:14:21,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:14:21,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:14:21,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:14:21,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:14:21,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:14:21,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-23 20:14:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/z3 [2023-11-23 20:14:21,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-23 20:14:21,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_517dfd18-dd7b-45a3-9364-545143b9c176/bin/ukojak-verify-1t5iHCbJaC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-23 20:14:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:14:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 20:14:21,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 20:14:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:14:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:14:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:14:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:14:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:14:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:14:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:14:21,670 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:14:21,672 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:14:21,870 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:14:21,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:14:21,914 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 20:14:21,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:21 BoogieIcfgContainer [2023-11-23 20:14:21,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:14:21,917 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-23 20:14:21,918 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-23 20:14:21,928 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-23 20:14:21,928 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:21" (1/1) ... [2023-11-23 20:14:21,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:14:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2023-11-23 20:14:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-23 20:14:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:14:22,004 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:22,238 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-23 20:14:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2023-11-23 20:14:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-11-23 20:14:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:14:22,276 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:22,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 20:14:22,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:14:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 19 states and 25 transitions. [2023-11-23 20:14:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-11-23 20:14:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:14:22,596 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:22,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:14:22,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 26 states and 39 transitions. [2023-11-23 20:14:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2023-11-23 20:14:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:23,107 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:23,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:23,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:23,266 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 10 treesize of output 8 [2023-11-23 20:14:23,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:23,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2023-11-23 20:14:23,371 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-23 20:14:23,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-23 20:14:23,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2023-11-23 20:14:23,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:23,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 69 treesize of output 138 [2023-11-23 20:14:24,457 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:24,461 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-23 20:14:25,130 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:25,138 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:25,138 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 33 states and 56 transitions. [2023-11-23 20:14:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2023-11-23 20:14:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:27,836 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:27,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:27,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:27,908 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 10 treesize of output 8 [2023-11-23 20:14:27,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:27,940 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:27,941 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-23 20:14:27,947 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 34 treesize of output 33 [2023-11-23 20:14:28,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:28,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:28,799 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-23 20:14:28,800 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-23 20:14:28,807 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-23 20:14:28,870 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-23 20:14:28,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-23 20:14:28,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:28,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:28,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-23 20:14:29,016 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 24 treesize of output 23 [2023-11-23 20:14:29,076 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 21 treesize of output 20 [2023-11-23 20:14:29,283 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-23 20:14:29,284 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 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-23 20:14:29,428 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:29,430 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2023-11-23 20:14:30,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:30,345 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:30,345 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:30,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5)) is different from false [2023-11-23 20:14:30,718 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5))) is different from true [2023-11-23 20:14:30,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) .cse1 .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5)) is different from false [2023-11-23 20:14:31,101 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) .cse1 .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5))) is different from true [2023-11-23 20:14:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 36 states and 71 transitions. [2023-11-23 20:14:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 71 transitions. [2023-11-23 20:14:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:31,589 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:31,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-23 20:14:31,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:31,748 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 10 treesize of output 8 [2023-11-23 20:14:31,873 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 27 treesize of output 15 [2023-11-23 20:14:32,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2023-11-23 20:14:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:34,123 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:14:34,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= c_~ARR_SIZE~0 1) .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:14:34,268 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:14:34,273 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= c_~ARR_SIZE~0 1) .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:14:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 35 states and 75 transitions. [2023-11-23 20:14:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 75 transitions. [2023-11-23 20:14:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:35,569 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:35,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-23 20:14:35,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:35,650 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 10 treesize of output 8 [2023-11-23 20:14:35,684 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 27 treesize of output 15 [2023-11-23 20:14:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2023-11-23 20:14:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:36,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse5)) is different from false [2023-11-23 20:14:36,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))))) is different from false [2023-11-23 20:14:36,088 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse5))) is different from true [2023-11-23 20:14:36,093 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)))))) is different from true [2023-11-23 20:14:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 37 states and 87 transitions. [2023-11-23 20:14:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 87 transitions. [2023-11-23 20:14:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:36,226 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:36,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:36,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:36,285 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 10 treesize of output 8 [2023-11-23 20:14:36,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2023-11-23 20:14:36,313 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-23 20:14:36,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-23 20:14:36,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2023-11-23 20:14:36,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:36,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 69 treesize of output 138 [2023-11-23 20:14:36,780 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:36,783 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-23 20:14:37,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:37,167 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:37,167 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 37 states and 87 transitions. [2023-11-23 20:14:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 87 transitions. [2023-11-23 20:14:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:37,322 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:37,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:37,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:37,401 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 10 treesize of output 8 [2023-11-23 20:14:37,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:37,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2023-11-23 20:14:37,431 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-23 20:14:37,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-23 20:14:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2023-11-23 20:14:37,591 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:37,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 69 treesize of output 138 [2023-11-23 20:14:37,835 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:37,838 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-23 20:14:38,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:38,206 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:38,206 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 37 states and 87 transitions. [2023-11-23 20:14:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 87 transitions. [2023-11-23 20:14:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:38,266 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:38,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:38,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:38,318 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 10 treesize of output 8 [2023-11-23 20:14:38,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:38,341 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:38,341 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-23 20:14:38,346 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 34 treesize of output 33 [2023-11-23 20:14:39,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:39,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:39,424 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-23 20:14:39,424 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-23 20:14:39,462 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-23 20:14:39,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-23 20:14:39,475 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 24 treesize of output 23 [2023-11-23 20:14:39,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:39,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:39,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-23 20:14:39,614 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 21 treesize of output 20 [2023-11-23 20:14:39,807 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-23 20:14:39,807 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 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-23 20:14:39,950 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:39,952 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2023-11-23 20:14:40,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:40,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:40,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 188 treesize of output 87 [2023-11-23 20:14:40,335 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-23 20:14:40,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:40,645 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:40,645 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:40,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))))) is different from false [2023-11-23 20:14:40,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))))) is different from false [2023-11-23 20:14:40,837 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)))))) is different from true [2023-11-23 20:14:40,849 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)))))) is different from true [2023-11-23 20:14:40,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:14:41,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:14:41,056 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:14:41,064 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:14:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 40 states and 111 transitions. [2023-11-23 20:14:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 111 transitions. [2023-11-23 20:14:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:41,812 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:41,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 20:14:41,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:41,886 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 10 treesize of output 8 [2023-11-23 20:14:42,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:42,038 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:42,039 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-23 20:14:42,045 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 34 treesize of output 33 [2023-11-23 20:14:43,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:43,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:43,353 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-23 20:14:43,353 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-23 20:14:43,361 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 24 treesize of output 23 [2023-11-23 20:14:43,395 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-23 20:14:43,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2023-11-23 20:14:43,412 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-23 20:14:43,445 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:14:43,446 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 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-23 20:14:43,472 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-23 20:14:43,481 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-23 20:14:43,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:43,738 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:43,738 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:43,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse5)) is different from false [2023-11-23 20:14:44,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6)) is different from false [2023-11-23 20:14:44,125 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse5))) is different from true [2023-11-23 20:14:44,132 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6))) is different from true [2023-11-23 20:14:44,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) is different from false [2023-11-23 20:14:44,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 .cse3 .cse6 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5)) is different from false [2023-11-23 20:14:44,361 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5))) is different from true [2023-11-23 20:14:44,369 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 .cse3 .cse6 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5))) is different from true [2023-11-23 20:14:44,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5))) is different from false [2023-11-23 20:14:44,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:14:44,399 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)))) is different from true [2023-11-23 20:14:44,405 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:14:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 43 states and 139 transitions. [2023-11-23 20:14:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 139 transitions. [2023-11-23 20:14:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:45,205 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:45,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 20:14:45,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:45,314 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 10 treesize of output 8 [2023-11-23 20:14:45,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:45,338 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-23 20:14:45,340 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:45,342 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-23 20:14:46,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:46,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:46,725 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-23 20:14:46,726 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-23 20:14:46,741 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 24 treesize of output 23 [2023-11-23 20:14:46,773 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-23 20:14:46,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2023-11-23 20:14:46,789 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-23 20:14:46,802 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-23 20:14:46,850 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:14:46,850 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 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-23 20:14:46,881 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-23 20:14:47,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:47,096 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:14:47,096 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:14:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:14:47,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse2 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)) is different from false [2023-11-23 20:14:47,736 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse2 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))) is different from true [2023-11-23 20:14:47,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:14:47,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5)) is different from false [2023-11-23 20:14:47,992 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:14:47,999 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5))) is different from true [2023-11-23 20:14:48,015 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-23 20:14:48,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:14:48,033 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-23 20:14:48,041 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:14:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:14:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 46 states and 170 transitions. [2023-11-23 20:14:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 170 transitions. [2023-11-23 20:14:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:14:48,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:14:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:14:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:14:48,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:14:48,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:14:48,914 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 10 treesize of output 8 [2023-11-23 20:14:48,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:14:48,936 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-23 20:14:48,938 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:48,939 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-23 20:14:59,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:59,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:59,105 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-23 20:14:59,105 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-23 20:14:59,149 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-23 20:14:59,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-23 20:14:59,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:59,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:59,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-23 20:14:59,267 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 24 treesize of output 23 [2023-11-23 20:14:59,299 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 21 treesize of output 20 [2023-11-23 20:14:59,466 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-23 20:14:59,467 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 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-23 20:14:59,612 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:14:59,613 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2023-11-23 20:14:59,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:59,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:14:59,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:59,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:14:59,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 188 treesize of output 87 [2023-11-23 20:15:00,067 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-23 20:15:00,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:00,413 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:15:00,414 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:15:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:15:00,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6)) is different from false [2023-11-23 20:15:00,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6)))) is different from false [2023-11-23 20:15:00,857 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6))) is different from true [2023-11-23 20:15:00,867 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6))))) is different from true [2023-11-23 20:15:00,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:15:01,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-23 20:15:01,261 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:15:01,270 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-23 20:15:01,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:15:01,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:15:01,306 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:15:01,315 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:15:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:15:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 49 states and 206 transitions. [2023-11-23 20:15:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 206 transitions. [2023-11-23 20:15:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:15:02,798 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:15:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:15:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:15:02,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 20:15:02,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:15:02,863 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 10 treesize of output 8 [2023-11-23 20:15:02,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:15:02,889 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:15:02,890 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-23 20:15:02,897 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 34 treesize of output 33 [2023-11-23 20:15:05,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:15:05,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:15:05,223 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-23 20:15:05,224 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-23 20:15:05,271 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-23 20:15:05,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-23 20:15:05,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:05,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:05,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-23 20:15:05,387 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 24 treesize of output 23 [2023-11-23 20:15:05,468 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 21 treesize of output 20 [2023-11-23 20:15:05,647 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-23 20:15:05,648 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 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-23 20:15:05,723 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:15:05,724 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2023-11-23 20:15:05,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:15:05,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:05,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:05,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 188 treesize of output 87 [2023-11-23 20:15:06,382 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-23 20:15:06,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:06,799 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:15:06,800 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:15:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:15:06,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))))) is different from false [2023-11-23 20:15:07,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse2 .cse4 .cse5 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6))))) is different from false [2023-11-23 20:15:07,183 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6 (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)))))) is different from true [2023-11-23 20:15:07,191 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse3 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 .cse1 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5 .cse6)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6 (not (and .cse0 .cse2 .cse4 .cse5 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (not (and .cse0 .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 (<= 1 c_~ARR_SIZE~0) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6)))))) is different from true [2023-11-23 20:15:07,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) is different from false [2023-11-23 20:15:07,554 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5)) is different from false [2023-11-23 20:15:07,565 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5))) is different from true [2023-11-23 20:15:07,573 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5))) is different from true [2023-11-23 20:15:07,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5))) is different from false [2023-11-23 20:15:07,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-23 20:15:07,611 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)))) is different from true [2023-11-23 20:15:07,620 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-23 20:15:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-23 20:15:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 52 states and 246 transitions. [2023-11-23 20:15:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 246 transitions. [2023-11-23 20:15:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:15:09,080 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-23 20:15:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:15:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:15:09,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 20:15:09,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:15:09,180 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 10 treesize of output 8 [2023-11-23 20:15:09,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 20:15:09,213 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:15:09,214 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-23 20:15:09,221 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 34 treesize of output 33 [2023-11-23 20:15:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:15:11,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:15:11,439 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-23 20:15:11,439 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-23 20:15:11,447 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-23 20:15:11,496 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-23 20:15:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2023-11-23 20:15:11,504 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 24 treesize of output 23 [2023-11-23 20:15:11,525 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-23 20:15:11,595 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:15:11,595 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 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-23 20:15:11,611 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-23 20:15:11,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:15:11,930 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-23 20:15:11,931 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-23 20:15:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:15:11,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse5))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6)))) is different from false [2023-11-23 20:15:12,392 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse5))) .cse1 .cse2 .cse3 .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6)))) is different from false [2023-11-23 20:15:12,405 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse5))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6))))) is different from true [2023-11-23 20:15:12,415 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse6)) (= 0 (select .cse5 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse6)) .cse2 .cse3 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse5))) .cse1 .cse2 .cse3 .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse6 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse6))))) is different from true [2023-11-23 20:15:12,429 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) is different from false [2023-11-23 20:15:12,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 .cse3 .cse6 .cse4)) .cse5)) is different from false [2023-11-23 20:15:12,961 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5))) is different from true [2023-11-23 20:15:12,970 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse6 .cse4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse3 .cse4 .cse5)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 .cse3 .cse6 .cse4)) .cse5))) is different from true [2023-11-23 20:15:12,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-23 20:15:13,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse2 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 .cse3 .cse7 .cse4)) .cse5))) is different from false [2023-11-23 20:15:13,018 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-23 20:15:13,030 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse2 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 (not (and .cse0 (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse7 .cse4)) .cse1 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4 .cse5)) (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= (select v_DerPreprocessor_23 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse0 .cse1 .cse3 .cse7 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (and (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 (not (and .cse0 (exists ((v_arrayElimArr_48 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (and (= (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_48) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse1 .cse3 .cse7 .cse4)) .cse5)))) is different from true