./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/pcomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/pcomp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm --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 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:12:15,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:12:15,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:12:15,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:12:15,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:12:15,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:12:15,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:12:15,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:12:15,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:12:15,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:12:15,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:12:15,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:12:15,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:12:15,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:12:15,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:12:15,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:12:15,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:12:15,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:12:15,231 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:12:15,231 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:12:15,231 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:12:15,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:12:15,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:12:15,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:12:15,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:12:15,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:12:15,232 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:12:15,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:12:15,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm 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 -> 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 [2024-11-13 21:12:15,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:12:15,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:12:15,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:12:15,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:12:15,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:12:15,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/array-fpi/pcomp.c Unable to find full path for "g++" [2024-11-13 21:12:17,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:12:17,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:12:17,763 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/sv-benchmarks/c/array-fpi/pcomp.c [2024-11-13 21:12:17,769 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/data/08d3de1b9/b6cbf5ccbd0a42d19c1804251d7e9050/FLAG8c19aef59 [2024-11-13 21:12:17,783 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/data/08d3de1b9/b6cbf5ccbd0a42d19c1804251d7e9050 [2024-11-13 21:12:17,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:12:17,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:12:17,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:12:17,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:12:17,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:12:17,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:12:17" (1/1) ... [2024-11-13 21:12:17,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2973f411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:17, skipping insertion in model container [2024-11-13 21:12:17,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:12:17" (1/1) ... [2024-11-13 21:12:17,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:12:17,995 WARN L250 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_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/sv-benchmarks/c/array-fpi/pcomp.c[588,601] [2024-11-13 21:12:18,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:12:18,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:12:18,052 WARN L250 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_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/sv-benchmarks/c/array-fpi/pcomp.c[588,601] [2024-11-13 21:12:18,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:12:18,078 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:12:18,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18 WrapperNode [2024-11-13 21:12:18,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:12:18,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:12:18,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:12:18,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:12:18,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,111 INFO L138 Inliner]: procedures = 16, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-13 21:12:18,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:12:18,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:12:18,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:12:18,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:12:18,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:12:18,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:12:18,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:12:18,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:12:18,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:12:18,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:12:18,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:12:18,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dcd4a23-667e-4055-b37b-fa469b9ff1ca/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:12:18,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:12:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 21:12:18,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:12:18,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:12:18,481 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 21:12:18,481 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:12:18,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:12:18,525 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 21:12:18,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:12:18 BoogieIcfgContainer [2024-11-13 21:12:18,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:12:18,526 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:12:18,526 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:12:18,537 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:12:18,537 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:12:18" (1/1) ... [2024-11-13 21:12:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:12:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2024-11-13 21:12:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2024-11-13 21:12:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:12:18,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:12:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:18,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 21:12:18,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:12:19,142 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:12:19,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:12:19,184 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 [2024-11-13 21:12:19,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 21:12:19,359 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 [2024-11-13 21:12:19,391 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 [2024-11-13 21:12:19,505 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:12:19,508 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2024-11-13 21:12:19,652 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:12:19,654 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2024-11-13 21:12:20,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:20,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:20,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:20,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 44 treesize of output 22 [2024-11-13 21:12:20,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 5 treesize of output 3 [2024-11-13 21:12:20,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:20,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 24 [2024-11-13 21:12:20,341 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 [2024-11-13 21:12:20,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:20,440 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 21:12:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 17 states and 33 transitions. [2024-11-13 21:12:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 33 transitions. [2024-11-13 21:12:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:12:20,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 20 states and 47 transitions. [2024-11-13 21:12:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2024-11-13 21:12:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:12:21,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 21 states and 51 transitions. [2024-11-13 21:12:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. [2024-11-13 21:12:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:12:21,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 22 states and 55 transitions. [2024-11-13 21:12:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 55 transitions. [2024-11-13 21:12:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:12:22,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 21 states and 49 transitions. [2024-11-13 21:12:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 49 transitions. [2024-11-13 21:12:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:12:22,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 23 states and 56 transitions. [2024-11-13 21:12:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 56 transitions. [2024-11-13 21:12:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:12:22,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 22 states and 49 transitions. [2024-11-13 21:12:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2024-11-13 21:12:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:12:22,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 23 states and 53 transitions. [2024-11-13 21:12:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 53 transitions. [2024-11-13 21:12:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:12:22,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:12:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:23,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 21:12:23,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:12:23,060 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 14 treesize of output 12 [2024-11-13 21:12:23,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:23,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:23,087 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:12:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:12:23,093 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 [2024-11-13 21:12:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:23,213 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:23,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:12:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 24 states and 56 transitions. [2024-11-13 21:12:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 56 transitions. [2024-11-13 21:12:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:12:23,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:12:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:24,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 21:12:24,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:12:24,126 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 14 treesize of output 12 [2024-11-13 21:12:24,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:24,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:24,151 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:12:24,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:12:24,154 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 [2024-11-13 21:12:24,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:24,286 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:24,363 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 25 treesize of output 27 [2024-11-13 21:12:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 28 states and 69 transitions. [2024-11-13 21:12:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 69 transitions. [2024-11-13 21:12:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:12:25,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 32 states and 77 transitions. [2024-11-13 21:12:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 77 transitions. [2024-11-13 21:12:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:12:26,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 36 states and 96 transitions. [2024-11-13 21:12:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 96 transitions. [2024-11-13 21:12:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:12:27,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 37 states and 99 transitions. [2024-11-13 21:12:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 99 transitions. [2024-11-13 21:12:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:12:28,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 42 states and 113 transitions. [2024-11-13 21:12:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 113 transitions. [2024-11-13 21:12:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:12:29,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 45 states and 129 transitions. [2024-11-13 21:12:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 129 transitions. [2024-11-13 21:12:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:12:31,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:12:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 46 states and 129 transitions. [2024-11-13 21:12:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 129 transitions. [2024-11-13 21:12:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:12:31,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:12:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 50 states and 139 transitions. [2024-11-13 21:12:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 139 transitions. [2024-11-13 21:12:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:12:32,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:12:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 51 states and 137 transitions. [2024-11-13 21:12:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 137 transitions. [2024-11-13 21:12:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:12:33,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:12:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:34,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 21:12:34,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:12:34,405 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:12:34,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:12:34,423 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 [2024-11-13 21:12:34,444 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 [2024-11-13 21:12:34,495 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 [2024-11-13 21:12:34,548 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 [2024-11-13 21:12:34,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:34,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:34,620 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 21:12:34,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 67 [2024-11-13 21:12:34,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:34,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:34,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2024-11-13 21:12:34,826 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:12:34,827 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2024-11-13 21:12:34,832 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:12:34,833 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 251 [2024-11-13 21:12:35,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:12:35,008 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 63 treesize of output 36 [2024-11-13 21:12:35,034 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:12:35,037 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2024-11-13 21:12:35,085 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 14 treesize of output 12 [2024-11-13 21:12:45,484 WARN L286 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:12:45,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:45,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:12:45,586 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:12:45,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 179 [2024-11-13 21:12:45,609 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 90 treesize of output 88 [2024-11-13 21:12:45,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:45,986 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:46,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:12:46,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:12:46,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2024-11-13 21:12:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:12:56,900 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:13:17,122 WARN L286 SmtUtils]: Spent 20.13s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:13:27,508 WARN L286 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:13:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 59 states and 160 transitions. [2024-11-13 21:13:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 160 transitions. [2024-11-13 21:13:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:13:31,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:13:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:31,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 21:13:31,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:13:31,215 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:13:31,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:13:31,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:13:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:13:31,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:13:31,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 21:13:31,240 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 [2024-11-13 21:13:31,250 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 [2024-11-13 21:13:31,470 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:13:31,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 21:13:31,686 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:13:31,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 21:13:32,133 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 21:13:32,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2024-11-13 21:13:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:13:52,953 WARN L286 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 64 DAG size of output: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:14:13,379 WARN L286 SmtUtils]: Spent 20.19s on a formula simplification. DAG size of input: 66 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:14:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:14:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 69 states and 190 transitions. [2024-11-13 21:14:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 190 transitions. [2024-11-13 21:14:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:14:40,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:14:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:14:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:14:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:14:40,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 21:14:40,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:14:40,338 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:14:40,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:14:40,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:14:40,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:14:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:14:40,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 21:14:40,391 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 [2024-11-13 21:14:40,410 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 [2024-11-13 21:14:41,032 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:14:41,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 21:14:41,834 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:14:41,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 21:14:43,224 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 21:14:43,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2024-11-13 21:14:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:14:46,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse8 .cse10))))) (= .cse4 .cse9) (= .cse10 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse13)) .cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse0 0) 0) (= (select .cse4 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2024-11-13 21:16:00,512 WARN L286 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 68 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:16:00,527 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse13 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse8 .cse10))))) (= .cse4 .cse9) (= .cse10 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse13)) .cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse0 0) 0) (= (select .cse4 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2024-11-13 21:16:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 79 states and 229 transitions. [2024-11-13 21:16:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 229 transitions. [2024-11-13 21:16:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:16:46,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:16:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:46,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 21:16:46,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:16:46,847 INFO L349 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2024-11-13 21:16:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 21:16:46,932 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:16:46,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:16:57,869 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:16:57,869 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 31 [2024-11-13 21:16:59,352 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 21:16:59,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 21:17:01,084 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-13 21:17:01,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 58 [2024-11-13 21:17:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:17:04,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse0 0) 0) (= (select .cse4 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse6) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse10 0) 6) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2024-11-13 21:17:15,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse10 0) 6) .cse18)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse15 .cse16 .cse17 (not .cse6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse18))) is different from false [2024-11-13 21:17:25,120 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse0 0) 0) (= (select .cse4 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse6) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse10 0) 6) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2024-11-13 21:17:35,128 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse10 0) 6) .cse18)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse15 .cse16 .cse17 (not .cse6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse18)))) is different from true [2024-11-13 21:17:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 80 states and 236 transitions. [2024-11-13 21:17:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 236 transitions. [2024-11-13 21:17:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:41,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 21:17:41,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:41,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:41,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:17:41,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:41,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:41,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:41,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 21:17:41,300 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 [2024-11-13 21:17:41,325 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 [2024-11-13 21:17:41,395 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:41,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 21:17:41,495 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:41,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 21:17:41,662 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 21:17:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2024-11-13 21:17:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:17:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 80 states and 236 transitions. [2024-11-13 21:17:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 236 transitions. [2024-11-13 21:17:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:43,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 21:17:43,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:43,525 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:43,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:17:43,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:43,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:43,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 21:17:43,583 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 [2024-11-13 21:17:43,608 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 [2024-11-13 21:17:43,672 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 21:17:43,798 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:43,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 21:17:43,955 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 21:17:43,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2024-11-13 21:17:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:17:44,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse15 .cse16 .cse17 (not .cse6) .cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse19))) is different from false [2024-11-13 21:17:44,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse20 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse21 (not .cse6)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 .cse20 .cse15 .cse16 .cse17 .cse21 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (and .cse14 .cse20 .cse15 .cse16 .cse17 .cse21 .cse18)) .cse19))) is different from false [2024-11-13 21:17:54,304 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse15 .cse16 .cse17 (not .cse6) .cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse19)))) is different from true [2024-11-13 21:17:54,317 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse20 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse15 (= (select .cse0 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse21 (not .cse6)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 .cse20 .cse15 .cse16 .cse17 .cse21 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (and .cse14 .cse20 .cse15 .cse16 .cse17 .cse21 .cse18)) .cse19)))) is different from true [2024-11-13 21:17:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 81 states and 243 transitions. [2024-11-13 21:17:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 243 transitions. [2024-11-13 21:17:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:54,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:54,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 21:17:54,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:54,561 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:54,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:17:54,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2024-11-13 21:17:54,682 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:17:54,682 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 31 [2024-11-13 21:17:54,841 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 21:17:54,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 21:17:55,066 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-13 21:17:55,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 58 [2024-11-13 21:17:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:17:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 81 states and 243 transitions. [2024-11-13 21:17:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 243 transitions. [2024-11-13 21:17:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:55,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:55,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 21:17:55,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:55,732 INFO L349 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2024-11-13 21:17:55,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 21:17:55,900 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:17:55,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:17:55,996 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:17:55,997 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 31 [2024-11-13 21:17:56,167 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 21:17:56,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 21:17:56,431 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-13 21:17:56,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 58 [2024-11-13 21:17:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:17:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 81 states and 243 transitions. [2024-11-13 21:17:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 243 transitions. [2024-11-13 21:17:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:56,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 21:17:57,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:57,643 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:17:57,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:17:57,670 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 [2024-11-13 21:17:57,702 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 [2024-11-13 21:17:57,795 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 [2024-11-13 21:17:57,831 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 [2024-11-13 21:17:57,912 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:17:57,914 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2024-11-13 21:17:58,278 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:17:58,279 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2024-11-13 21:17:58,739 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:17:58,741 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 378 [2024-11-13 21:17:58,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:58,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:59,062 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:17:59,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 104 [2024-11-13 21:17:59,087 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 [2024-11-13 21:17:59,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:17:59,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:17:59,313 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:17:59,314 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2024-11-13 21:17:59,323 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 [2024-11-13 21:17:59,356 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:17:59,358 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 344 [2024-11-13 21:17:59,826 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 14 treesize of output 12 [2024-11-13 21:18:00,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:00,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:00,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:00,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:00,648 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 25 treesize of output 27 [2024-11-13 21:18:01,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:01,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:18:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 83 states and 253 transitions. [2024-11-13 21:18:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 253 transitions. [2024-11-13 21:18:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:10,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:10,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 21:18:10,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:11,060 INFO L349 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2024-11-13 21:18:11,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 21:18:11,141 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:18:11,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:18:11,190 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:18:11,191 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 31 [2024-11-13 21:18:11,367 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 21:18:11,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 21:18:11,561 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-13 21:18:11,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 58 [2024-11-13 21:18:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:18:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 83 states and 253 transitions. [2024-11-13 21:18:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 253 transitions. [2024-11-13 21:18:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:11,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:12,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 21:18:12,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:12,412 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 14 treesize of output 12 [2024-11-13 21:18:12,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:12,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:12,532 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:18:12,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:18:12,552 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 [2024-11-13 21:18:12,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:12,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:12,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:12,656 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:12,692 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 25 treesize of output 27 [2024-11-13 21:18:12,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:18:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 83 states and 253 transitions. [2024-11-13 21:18:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 253 transitions. [2024-11-13 21:18:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:15,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:15,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 21:18:15,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:15,470 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 14 treesize of output 12 [2024-11-13 21:18:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:15,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:15,591 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:18:15,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:18:15,610 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 [2024-11-13 21:18:15,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:15,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:15,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:15,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:15,830 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 25 treesize of output 27 [2024-11-13 21:18:15,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:15,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:18:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:18:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 83 states and 253 transitions. [2024-11-13 21:18:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 253 transitions. [2024-11-13 21:18:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:16,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:16,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 21:18:16,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:17,041 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:18:17,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:18:17,062 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 [2024-11-13 21:18:17,083 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 [2024-11-13 21:18:17,117 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 [2024-11-13 21:18:17,234 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 [2024-11-13 21:18:17,454 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:17,455 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2024-11-13 21:18:17,817 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:17,819 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2024-11-13 21:18:18,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:18,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:18,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:18,379 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 73 [2024-11-13 21:18:18,427 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:18,428 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 371 [2024-11-13 21:18:18,989 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:18,992 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 350 [2024-11-13 21:18:19,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:19,476 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:18:19,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 83 [2024-11-13 21:18:19,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 14 treesize of output 12 [2024-11-13 21:18:20,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:20,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:20,576 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:20,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:20,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:18:20,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2024-11-13 21:18:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 83 states and 253 transitions. [2024-11-13 21:18:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 253 transitions. [2024-11-13 21:18:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:21,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:21,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 21:18:21,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:22,463 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:18:22,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:18:22,485 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 [2024-11-13 21:18:22,515 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 [2024-11-13 21:18:22,619 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 [2024-11-13 21:18:22,645 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 [2024-11-13 21:18:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:22,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:22,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2024-11-13 21:18:22,828 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 [2024-11-13 21:18:23,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:23,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:23,133 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 21:18:23,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 94 [2024-11-13 21:18:23,256 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 [2024-11-13 21:18:23,305 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 [2024-11-13 21:18:23,464 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:23,465 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 87 [2024-11-13 21:18:23,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:23,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:23,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2024-11-13 21:18:23,603 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 [2024-11-13 21:18:23,618 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:23,619 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2024-11-13 21:18:23,626 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:23,627 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 122 [2024-11-13 21:18:23,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:23,855 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 36 [2024-11-13 21:18:23,901 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 14 treesize of output 12 [2024-11-13 21:18:35,269 WARN L286 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:18:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:35,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:18:35,454 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:18:35,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 179 [2024-11-13 21:18:35,474 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 99 treesize of output 97 [2024-11-13 21:18:35,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:35,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:35,623 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:18:35,666 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 25 treesize of output 27 [2024-11-13 21:18:35,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:35,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:18:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:35,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26))) is different from false [2024-11-13 21:18:46,941 WARN L286 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:18:46,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse29 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse0 (= (select .cse29 |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse28 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 .cse20 .cse15 .cse16 (not (and .cse0 (let ((.cse25 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse25))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse21 v_DerPreprocessor_46) (= .cse4 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse21 .cse23) (= .cse4 (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse23) (= .cse10 .cse23) (= v_DerPreprocessor_45 (store .cse23 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse6 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse25))) (and (= (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse4 (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) .cse20 .cse28 .cse19)) .cse17 (not .cse6) .cse18 .cse28 .cse19))) is different from false [2024-11-13 21:18:46,985 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26)))) is different from true [2024-11-13 21:18:47,009 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (= (select .cse29 0) 0)) (.cse16 (= (select .cse4 0) 1)) (.cse0 (= (select .cse29 |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse28 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 0)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse1) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse3 .cse1) (= .cse4 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse3))))))) .cse6) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 0 0)))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse7) (= .cse8 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse8 0 0)) (= .cse9 .cse7) (= .cse8 .cse10) (= .cse8 .cse11))))) (= .cse4 .cse9) (= .cse11 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse9)))))) .cse14)) (not (and .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse10 0) 6) .cse19)) .cse14 .cse20 .cse15 .cse16 (not (and .cse0 (let ((.cse25 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse25))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse21 v_DerPreprocessor_46) (= .cse4 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse21 .cse23) (= .cse4 (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse23) (= .cse10 .cse23) (= v_DerPreprocessor_45 (store .cse23 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse6 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse25))) (and (= (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse4 (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) .cse20 .cse28 .cse19)) .cse17 (not .cse6) .cse18 .cse28 .cse19)))) is different from true [2024-11-13 21:18:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 84 states and 261 transitions. [2024-11-13 21:18:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 261 transitions. [2024-11-13 21:18:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:18:47,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:47,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 21:18:47,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:47,745 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:18:47,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:18:47,767 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 [2024-11-13 21:18:47,794 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 [2024-11-13 21:18:47,825 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 [2024-11-13 21:18:47,918 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 [2024-11-13 21:18:47,991 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:47,992 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2024-11-13 21:18:48,552 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:48,553 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2024-11-13 21:18:48,860 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:48,862 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 414 [2024-11-13 21:18:49,830 INFO L349 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2024-11-13 21:18:49,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 212 [2024-11-13 21:18:50,268 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:50,269 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2024-11-13 21:18:50,457 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:18:50,458 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 141 [2024-11-13 21:18:50,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:18:50,837 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 33 treesize of output 11 [2024-11-13 21:18:50,996 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 14 treesize of output 12 [2024-11-13 21:20:52,730 WARN L286 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:20:52,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:20:52,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:20:52,907 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:20:52,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 186 [2024-11-13 21:20:53,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:20:53,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:20:53,096 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:20:53,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:20:53,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:20:53,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-13 21:20:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:20:55,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse29 (store .cse27 0 0))) (and (= (select .cse27 0) 0) (= v_DerPreprocessor_61 .cse28) (= .cse2 .cse27) (= .cse28 .cse29) (= .cse6 .cse29) (= v_DerPreprocessor_63 .cse29)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store .cse31 0 0))) (and (= .cse2 .cse31) (= (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) .cse33) (= .cse6 .cse33) (= v_DerPreprocessor_63 .cse33))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse34) (= .cse2 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse34) (= v_DerPreprocessor_60 (store .cse34 0 0)))))) .cse9) .cse22)) .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26))) is different from false [2024-11-13 21:21:36,491 WARN L286 SmtUtils]: Spent 40.16s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:21:36,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse37 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (and .cse27 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse28 (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse30 (store .cse28 0 0))) (and (= (select .cse28 0) 0) (= v_DerPreprocessor_61 .cse29) (= .cse2 .cse28) (= .cse29 .cse30) (= .cse6 .cse30) (= v_DerPreprocessor_63 .cse30)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse34 (store .cse32 0 0))) (and (= .cse2 .cse32) (= (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) .cse34) (= .cse6 .cse34) (= v_DerPreprocessor_63 .cse34))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse35) (= .cse2 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse35) (= v_DerPreprocessor_60 (store .cse35 0 0)))))) .cse9) .cse22)) .cse24 .cse37 .cse26)) .cse27 .cse22 .cse23 .cse24 (not .cse9) .cse25 .cse37 .cse26))) is different from false [2024-11-13 21:21:36,544 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse29 (store .cse27 0 0))) (and (= (select .cse27 0) 0) (= v_DerPreprocessor_61 .cse28) (= .cse2 .cse27) (= .cse28 .cse29) (= .cse6 .cse29) (= v_DerPreprocessor_63 .cse29)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store .cse31 0 0))) (and (= .cse2 .cse31) (= (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) .cse33) (= .cse6 .cse33) (= v_DerPreprocessor_63 .cse33))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse34) (= .cse2 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse34) (= v_DerPreprocessor_60 (store .cse34 0 0)))))) .cse9) .cse22)) .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26)))) is different from true [2024-11-13 21:21:36,569 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse37 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) .cse21 (not (and .cse27 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse28 (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse30 (store .cse28 0 0))) (and (= (select .cse28 0) 0) (= v_DerPreprocessor_61 .cse29) (= .cse2 .cse28) (= .cse29 .cse30) (= .cse6 .cse30) (= v_DerPreprocessor_63 .cse30)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse34 (store .cse32 0 0))) (and (= .cse2 .cse32) (= (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) .cse34) (= .cse6 .cse34) (= v_DerPreprocessor_63 .cse34))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse35) (= .cse2 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse35) (= v_DerPreprocessor_60 (store .cse35 0 0)))))) .cse9) .cse22)) .cse24 .cse37 .cse26)) .cse27 .cse22 .cse23 .cse24 (not .cse9) .cse25 .cse37 .cse26)))) is different from true [2024-11-13 21:21:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 85 states and 269 transitions. [2024-11-13 21:21:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 269 transitions. [2024-11-13 21:21:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:21:38,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:39,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 21:21:39,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:21:39,054 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 14 treesize of output 12 [2024-11-13 21:21:39,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:21:39,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:21:39,116 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:21:39,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:21:39,122 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 [2024-11-13 21:21:39,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:39,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:39,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:39,221 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:39,259 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 25 treesize of output 27 [2024-11-13 21:21:39,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:39,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:21:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:21:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 85 states and 269 transitions. [2024-11-13 21:21:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 269 transitions. [2024-11-13 21:21:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:21:39,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:21:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:39,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 21:21:39,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:21:40,045 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:21:40,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:21:40,070 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 [2024-11-13 21:21:40,184 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 [2024-11-13 21:21:40,223 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 [2024-11-13 21:21:40,257 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 [2024-11-13 21:21:40,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,488 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 21:21:40,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 75 [2024-11-13 21:21:40,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,599 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 54 treesize of output 32 [2024-11-13 21:21:40,740 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-13 21:21:40,741 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 6 case distinctions, treesize of input 114 treesize of output 100 [2024-11-13 21:21:40,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:40,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2024-11-13 21:21:40,895 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 [2024-11-13 21:21:40,935 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:40,936 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-13 21:21:40,961 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:40,961 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 21:21:41,019 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:41,019 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 21:21:41,096 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 14 treesize of output 12 [2024-11-13 21:21:41,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:41,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:41,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:41,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:41,277 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 25 treesize of output 27 [2024-11-13 21:21:41,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:21:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:21:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 85 states and 269 transitions. [2024-11-13 21:21:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 269 transitions. [2024-11-13 21:21:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:21:41,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:21:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:41,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 21:21:41,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:21:41,975 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:21:41,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:21:41,991 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 [2024-11-13 21:21:42,067 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 [2024-11-13 21:21:42,094 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 [2024-11-13 21:21:42,122 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 [2024-11-13 21:21:42,307 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:42,308 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2024-11-13 21:21:42,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:21:42,601 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-13 21:21:42,601 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 6 case distinctions, treesize of input 144 treesize of output 134 [2024-11-13 21:21:42,697 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 [2024-11-13 21:21:42,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:42,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:42,920 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-11-13 21:21:42,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 85 [2024-11-13 21:21:43,049 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 [2024-11-13 21:21:43,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:43,141 INFO L349 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2024-11-13 21:21:43,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 52 [2024-11-13 21:21:43,195 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 [2024-11-13 21:21:43,216 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:43,217 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 351 [2024-11-13 21:21:43,553 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 14 treesize of output 12 [2024-11-13 21:21:43,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:43,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:43,620 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:43,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:21:43,673 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 25 treesize of output 27 [2024-11-13 21:21:43,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:43,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:21:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:21:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 85 states and 269 transitions. [2024-11-13 21:21:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 269 transitions. [2024-11-13 21:21:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:21:45,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:21:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:45,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 21:21:45,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:21:45,539 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:21:45,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:21:45,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2024-11-13 21:21:45,671 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:21:45,672 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 31 [2024-11-13 21:21:46,487 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 21:21:46,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-11-13 21:21:46,657 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 21:21:46,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 21:21:47,377 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-13 21:21:47,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 60 [2024-11-13 21:21:49,215 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-13 21:21:49,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 60 treesize of output 70 [2024-11-13 21:21:50,184 INFO L349 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2024-11-13 21:21:50,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 67 treesize of output 80 [2024-11-13 21:21:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 85 states and 269 transitions. [2024-11-13 21:21:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 269 transitions. [2024-11-13 21:21:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:21:58,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:21:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:58,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 21:21:58,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:21:58,647 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:21:58,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:21:58,672 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 [2024-11-13 21:21:58,701 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 [2024-11-13 21:21:58,734 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 [2024-11-13 21:21:58,877 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 [2024-11-13 21:21:59,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:59,265 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-13 21:21:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 94 [2024-11-13 21:21:59,458 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:59,459 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2024-11-13 21:21:59,554 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:59,555 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2024-11-13 21:21:59,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:21:59,720 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:21:59,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2024-11-13 21:21:59,753 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:21:59,754 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2024-11-13 21:21:59,961 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 14 treesize of output 12 [2024-11-13 21:22:11,341 WARN L286 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:22:11,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:11,450 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:22:11,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 64 [2024-11-13 21:22:11,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:11,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:11,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:11,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:22:11,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:11,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-13 21:22:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:22:12,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 0 0)))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse27) (= v_DerPreprocessor_80 .cse27) (= .cse28 v_DerPreprocessor_79) (= .cse6 .cse28))))) .cse9) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse32 (store .cse30 0 0))) (and (= (select .cse30 0) 0) (= v_DerPreprocessor_61 .cse31) (= .cse2 .cse30) (= .cse31 .cse32) (= .cse6 .cse32) (= v_DerPreprocessor_63 .cse32)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse36 (store .cse34 0 0))) (and (= .cse2 .cse34) (= (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse36) (= .cse6 .cse36) (= v_DerPreprocessor_63 .cse36))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse37) (= .cse2 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse37) (= v_DerPreprocessor_60 (store .cse37 0 0)))))) .cse9) .cse22)) .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26))) is different from false [2024-11-13 21:22:13,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse29 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (= (select .cse0 0) 0)) (.cse30 (= (select .cse2 0) 1)) (.cse16 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse31 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse17 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse18 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 0 0)))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse14 .cse15 .cse16 .cse17 .cse18)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse21 0 0)))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse19) (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse21 .cse19) (= .cse2 .cse21) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse21))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse25 0 0)))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse24 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse23) (= .cse24 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse24 0 0)) (= .cse25 .cse23) (= .cse24 .cse6) (= .cse24 .cse26))))) (= .cse2 .cse25) (= .cse26 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse25)))))) .cse29)) (not (and .cse29 .cse15 .cse30 .cse16 .cse31 (= (select .cse6 0) 6) .cse18)) .cse29 .cse14 .cse15 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (store .cse32 0 0))) (and (= (select .cse32 0) 0) (= v_DerPreprocessor_61 .cse33) (= .cse2 .cse32) (= .cse33 .cse34) (= .cse6 .cse34) (= v_DerPreprocessor_63 .cse34)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse38 (store .cse36 0 0))) (and (= .cse2 .cse36) (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) (= .cse6 .cse38) (= v_DerPreprocessor_63 .cse38))))))) .cse15) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse39) (= .cse2 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse39) (= v_DerPreprocessor_60 (store .cse39 0 0)))))) .cse9) .cse15)) .cse30 .cse16 (not .cse9) .cse31 .cse17 .cse18))) is different from false [2024-11-13 21:22:13,441 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (= (select .cse0 0) 0)) (.cse23 (= (select .cse2 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 0 0)))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse11) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse13 .cse11) (= .cse2 .cse13) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse13))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 0 0)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse15) (= .cse16 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse16 0 0)) (= .cse17 .cse15) (= .cse16 .cse6) (= .cse16 .cse18))))) (= .cse2 .cse17) (= .cse18 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse17)))))) .cse21)) (not (and .cse21 .cse22 .cse23 .cse24 .cse25 (= (select .cse6 0) 6) .cse26)) (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 0 0)))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse27) (= v_DerPreprocessor_80 .cse27) (= .cse28 v_DerPreprocessor_79) (= .cse6 .cse28))))) .cse9) .cse21 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse22 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse32 (store .cse30 0 0))) (and (= (select .cse30 0) 0) (= v_DerPreprocessor_61 .cse31) (= .cse2 .cse30) (= .cse31 .cse32) (= .cse6 .cse32) (= v_DerPreprocessor_63 .cse32)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse36 (store .cse34 0 0))) (and (= .cse2 .cse34) (= (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse36) (= .cse6 .cse36) (= v_DerPreprocessor_63 .cse36))))))) .cse22) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse37) (= .cse2 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse37) (= v_DerPreprocessor_60 (store .cse37 0 0)))))) .cse9) .cse22)) .cse23 .cse24 (not .cse9) .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) .cse26)))) is different from true [2024-11-13 21:22:13,461 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse29 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (= (select .cse0 0) 0)) (.cse30 (= (select .cse2 0) 1)) (.cse16 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse31 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse17 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse18 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 0 0)))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse14 .cse15 .cse16 .cse17 .cse18)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse21 0 0)))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse19) (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse21 .cse19) (= .cse2 .cse21) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse21))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse25 0 0)))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse24 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse23) (= .cse24 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse24 0 0)) (= .cse25 .cse23) (= .cse24 .cse6) (= .cse24 .cse26))))) (= .cse2 .cse25) (= .cse26 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse25)))))) .cse29)) (not (and .cse29 .cse15 .cse30 .cse16 .cse31 (= (select .cse6 0) 6) .cse18)) .cse29 .cse14 .cse15 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (store .cse32 0 0))) (and (= (select .cse32 0) 0) (= v_DerPreprocessor_61 .cse33) (= .cse2 .cse32) (= .cse33 .cse34) (= .cse6 .cse34) (= v_DerPreprocessor_63 .cse34)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse38 (store .cse36 0 0))) (and (= .cse2 .cse36) (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) (= .cse6 .cse38) (= v_DerPreprocessor_63 .cse38))))))) .cse15) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse39) (= .cse2 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse39) (= v_DerPreprocessor_60 (store .cse39 0 0)))))) .cse9) .cse15)) .cse30 .cse16 (not .cse9) .cse31 .cse17 .cse18)))) is different from true [2024-11-13 21:22:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 86 states and 277 transitions. [2024-11-13 21:22:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 277 transitions. [2024-11-13 21:22:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:13,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:22:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:13,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 21:22:13,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:22:13,754 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 14 treesize of output 12 [2024-11-13 21:22:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:13,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:13,842 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:22:13,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:22:13,851 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 [2024-11-13 21:22:13,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:13,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:13,945 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:13,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:14,006 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 25 treesize of output 27 [2024-11-13 21:22:14,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:14,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:22:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:22:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 86 states and 277 transitions. [2024-11-13 21:22:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 277 transitions. [2024-11-13 21:22:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:16,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:22:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 87 states and 278 transitions. [2024-11-13 21:22:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 278 transitions. [2024-11-13 21:22:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:18,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:22:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:18,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 21:22:18,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:22:18,953 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:22:18,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:22:18,977 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 [2024-11-13 21:22:19,001 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 [2024-11-13 21:22:19,096 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 [2024-11-13 21:22:19,124 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 [2024-11-13 21:22:19,180 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:19,181 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 194 [2024-11-13 21:22:19,719 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:19,720 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 170 [2024-11-13 21:22:20,028 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:20,030 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 381 [2024-11-13 21:22:20,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:20,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:20,313 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:22:20,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 100 [2024-11-13 21:22:20,329 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 [2024-11-13 21:22:20,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:22:20,543 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:22:20,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 416 treesize of output 392 [2024-11-13 21:22:20,813 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 [2024-11-13 21:22:20,852 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 [2024-11-13 21:22:20,971 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 14 treesize of output 12 [2024-11-13 21:22:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,105 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 25 treesize of output 27 [2024-11-13 21:22:21,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:22:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:22:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 87 states and 278 transitions. [2024-11-13 21:22:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 278 transitions. [2024-11-13 21:22:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:21,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:22:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:21,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 21:22:21,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:22:21,462 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 14 treesize of output 12 [2024-11-13 21:22:21,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:21,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:21,525 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:22:21,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:22:21,536 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 [2024-11-13 21:22:21,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,621 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:22:21,655 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 25 treesize of output 27 [2024-11-13 21:22:21,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:21,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:22:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:22:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 87 states and 278 transitions. [2024-11-13 21:22:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 278 transitions. [2024-11-13 21:22:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:23,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:22:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:23,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 21:22:23,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:22:24,369 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:22:24,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:22:24,394 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 [2024-11-13 21:22:24,430 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 [2024-11-13 21:22:24,459 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 [2024-11-13 21:22:24,646 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 [2024-11-13 21:22:24,670 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:24,671 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 127 [2024-11-13 21:22:25,045 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:25,046 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2024-11-13 21:22:25,214 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:25,216 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 206 [2024-11-13 21:22:25,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:22:25,607 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2024-11-13 21:22:25,607 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 4 case distinctions, treesize of input 492 treesize of output 468 [2024-11-13 21:22:25,769 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:25,769 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 93 [2024-11-13 21:22:25,851 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:22:25,851 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2024-11-13 21:22:26,053 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 14 treesize of output 12 [2024-11-13 21:24:07,992 WARN L286 SmtUtils]: Spent 1.34m on a formula simplification. DAG size of input: 82 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:24:08,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:24:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:24:08,135 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:24:08,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 162 [2024-11-13 21:24:08,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:08,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:08,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:08,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:24:08,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2024-11-13 21:24:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:08,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (store .cse6 0 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse16 (= (select .cse0 0) 0)) (.cse31 (= (select .cse2 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse34 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse33) (= .cse34 v_DerPreprocessor_109) (= .cse2 .cse33) (= .cse6 .cse34))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse37 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (= (select .cse36 0) 0) (= .cse37 v_DerPreprocessor_109) (= .cse2 .cse36) (= .cse6 .cse37)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse40 0 0) .cse6) (= .cse2 .cse40) (= (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse44 (store .cse42 0 0))) (and (= (select .cse42 0) 0) (= v_DerPreprocessor_61 .cse43) (= .cse2 .cse42) (= .cse43 .cse44) (= .cse6 .cse44) (= v_DerPreprocessor_63 .cse44)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse46 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse48 (store .cse46 0 0))) (and (= .cse2 .cse46) (= (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) .cse48) (= .cse6 .cse48) (= v_DerPreprocessor_63 .cse48))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse49) (= .cse2 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse49) (= v_DerPreprocessor_60 (store .cse49 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 .cse18 .cse19))) is different from false [2024-11-13 21:24:39,725 WARN L286 SmtUtils]: Spent 30.25s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:24:39,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse0 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse33 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse35 (store .cse33 0 0))) (and (= (select .cse33 0) 0) (= v_DerPreprocessor_61 .cse34) (= .cse2 .cse33) (= .cse34 .cse35) (= .cse6 .cse35) (= v_DerPreprocessor_63 .cse35)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse39 (store .cse37 0 0))) (and (= .cse2 .cse37) (= (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) .cse39) (= .cse6 .cse39) (= v_DerPreprocessor_63 .cse39))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse40) (= .cse2 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse40) (= v_DerPreprocessor_60 (store .cse40 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse43 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse42) (= .cse43 v_DerPreprocessor_109) (= .cse2 .cse42) (= .cse6 .cse43))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse45 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse46 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse45) (= (select .cse45 0) 0) (= .cse46 v_DerPreprocessor_109) (= .cse2 .cse45) (= .cse6 .cse46)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse49 0 0) .cse6) (= .cse2 .cse49) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19))) is different from false [2024-11-13 21:24:39,791 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (store .cse6 0 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse16 (= (select .cse0 0) 0)) (.cse31 (= (select .cse2 0) 1)) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse34 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse33) (= .cse34 v_DerPreprocessor_109) (= .cse2 .cse33) (= .cse6 .cse34))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse37 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (= (select .cse36 0) 0) (= .cse37 v_DerPreprocessor_109) (= .cse2 .cse36) (= .cse6 .cse37)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse40 0 0) .cse6) (= .cse2 .cse40) (= (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse44 (store .cse42 0 0))) (and (= (select .cse42 0) 0) (= v_DerPreprocessor_61 .cse43) (= .cse2 .cse42) (= .cse43 .cse44) (= .cse6 .cse44) (= v_DerPreprocessor_63 .cse44)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse46 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse48 (store .cse46 0 0))) (and (= .cse2 .cse46) (= (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) .cse48) (= .cse6 .cse48) (= v_DerPreprocessor_63 .cse48))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse49) (= .cse2 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse49) (= v_DerPreprocessor_60 (store .cse49 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 .cse18 .cse19)))) is different from true [2024-11-13 21:24:39,813 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse0 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse33 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse35 (store .cse33 0 0))) (and (= (select .cse33 0) 0) (= v_DerPreprocessor_61 .cse34) (= .cse2 .cse33) (= .cse34 .cse35) (= .cse6 .cse35) (= v_DerPreprocessor_63 .cse35)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse39 (store .cse37 0 0))) (and (= .cse2 .cse37) (= (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) .cse39) (= .cse6 .cse39) (= v_DerPreprocessor_63 .cse39))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse40) (= .cse2 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse40) (= v_DerPreprocessor_60 (store .cse40 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse43 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse42) (= .cse43 v_DerPreprocessor_109) (= .cse2 .cse42) (= .cse6 .cse43))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse45 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse46 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse45) (= (select .cse45 0) 0) (= .cse46 v_DerPreprocessor_109) (= .cse2 .cse45) (= .cse6 .cse46)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse49 0 0) .cse6) (= .cse2 .cse49) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19)))) is different from true [2024-11-13 21:24:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 88 states and 286 transitions. [2024-11-13 21:24:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 286 transitions. [2024-11-13 21:24:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:24:39,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:24:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:40,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 21:24:40,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:24:40,025 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 14 treesize of output 12 [2024-11-13 21:24:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:24:40,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:24:40,119 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:24:40,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:24:40,128 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 [2024-11-13 21:24:40,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:40,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:40,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:40,270 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:24:40,335 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 25 treesize of output 27 [2024-11-13 21:24:40,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:24:40,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:24:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 88 states and 286 transitions. [2024-11-13 21:24:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 286 transitions. [2024-11-13 21:24:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:24:42,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:24:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:42,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 21:24:42,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:24:43,289 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:24:43,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:24:43,309 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 [2024-11-13 21:24:43,396 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 [2024-11-13 21:24:43,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:24:43,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 21:24:43,450 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 [2024-11-13 21:24:43,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:43,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:43,669 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 21:24:43,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 106 [2024-11-13 21:24:43,847 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 [2024-11-13 21:24:43,871 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 [2024-11-13 21:24:43,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:43,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:43,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:43,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 51 treesize of output 29 [2024-11-13 21:24:43,991 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 [2024-11-13 21:24:44,139 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:24:44,140 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 140 [2024-11-13 21:24:44,146 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:24:44,146 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2024-11-13 21:24:44,450 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:24:44,451 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 36 treesize of output 14 [2024-11-13 21:24:44,469 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:24:44,470 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2024-11-13 21:24:44,582 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 14 treesize of output 12 [2024-11-13 21:25:35,815 WARN L286 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:25:35,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:25:35,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:25:35,918 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 21:25:35,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 179 [2024-11-13 21:25:35,935 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 90 treesize of output 88 [2024-11-13 21:25:35,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:25:36,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:25:36,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:25:36,068 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 25 treesize of output 27 [2024-11-13 21:25:36,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:25:36,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:25:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:25:37,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse0 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (or (and (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (and (= v_DerPreprocessor_115 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 .cse2) (= (select v_DerPreprocessor_114 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_112 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))))))) .cse9) (exists ((v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse36 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_115 .cse37) (= .cse36 .cse37) (= .cse38 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= .cse38 .cse2) (= v_DerPreprocessor_112 .cse36) (= v_DerPreprocessor_114 (store .cse36 |c_ULTIMATE.start_main_~c~0#1.offset| 0))))))) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (store .cse41 0 0))) (and (= (select .cse41 0) 0) (= v_DerPreprocessor_61 .cse42) (= .cse2 .cse41) (= .cse42 .cse43) (= .cse6 .cse43) (= v_DerPreprocessor_63 .cse43)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse47 (store .cse45 0 0))) (and (= .cse2 .cse45) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse47) (= .cse6 .cse47) (= v_DerPreprocessor_63 .cse47))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse48) (= .cse2 (select .cse49 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse48) (= v_DerPreprocessor_60 (store .cse48 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse51 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse50) (= .cse51 v_DerPreprocessor_109) (= .cse2 .cse50) (= .cse6 .cse51))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse54 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse53) (= (select .cse53 0) 0) (= .cse54 v_DerPreprocessor_109) (= .cse2 .cse53) (= .cse6 .cse54)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse57 0 0) .cse6) (= .cse2 .cse57) (= (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19))) is different from false [2024-11-13 21:26:58,188 WARN L286 SmtUtils]: Spent 20.10s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 21:26:58,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= (select .cse59 |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse59 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (not (and .cse0 (or (and (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (and (= v_DerPreprocessor_115 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 .cse2) (= (select v_DerPreprocessor_114 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_112 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))))))) .cse9) (exists ((v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse36 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_115 .cse37) (= .cse36 .cse37) (= .cse38 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= .cse38 .cse2) (= v_DerPreprocessor_112 .cse36) (= v_DerPreprocessor_114 (store .cse36 |c_ULTIMATE.start_main_~c~0#1.offset| 0))))))) .cse15 .cse18 .cse19)) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (store .cse41 0 0))) (and (= (select .cse41 0) 0) (= v_DerPreprocessor_61 .cse42) (= .cse2 .cse41) (= .cse42 .cse43) (= .cse6 .cse43) (= v_DerPreprocessor_63 .cse43)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse47 (store .cse45 0 0))) (and (= .cse2 .cse45) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse47) (= .cse6 .cse47) (= v_DerPreprocessor_63 .cse47))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse48) (= .cse2 (select .cse49 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse48) (= v_DerPreprocessor_60 (store .cse48 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse51 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse50) (= .cse51 v_DerPreprocessor_109) (= .cse2 .cse50) (= .cse6 .cse51))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse54 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse53) (= (select .cse53 0) 0) (= .cse54 v_DerPreprocessor_109) (= .cse2 .cse53) (= .cse6 .cse54)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse57 0 0) .cse6) (= .cse2 .cse57) (= (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19))) is different from false [2024-11-13 21:26:58,243 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse0 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (or (and (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (and (= v_DerPreprocessor_115 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 .cse2) (= (select v_DerPreprocessor_114 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_112 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))))))) .cse9) (exists ((v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse36 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_115 .cse37) (= .cse36 .cse37) (= .cse38 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= .cse38 .cse2) (= v_DerPreprocessor_112 .cse36) (= v_DerPreprocessor_114 (store .cse36 |c_ULTIMATE.start_main_~c~0#1.offset| 0))))))) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (store .cse41 0 0))) (and (= (select .cse41 0) 0) (= v_DerPreprocessor_61 .cse42) (= .cse2 .cse41) (= .cse42 .cse43) (= .cse6 .cse43) (= v_DerPreprocessor_63 .cse43)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse47 (store .cse45 0 0))) (and (= .cse2 .cse45) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse47) (= .cse6 .cse47) (= v_DerPreprocessor_63 .cse47))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse48) (= .cse2 (select .cse49 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse48) (= v_DerPreprocessor_60 (store .cse48 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse51 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse50) (= .cse51 v_DerPreprocessor_109) (= .cse2 .cse50) (= .cse6 .cse51))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse54 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse53) (= (select .cse53 0) 0) (= .cse54 v_DerPreprocessor_109) (= .cse2 .cse53) (= .cse6 .cse54)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse57 0 0) .cse6) (= .cse2 .cse57) (= (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19)))) is different from true [2024-11-13 21:26:58,273 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= (select .cse59 |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (.cse31 (= (select .cse2 0) 1)) (.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse30 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (store .cse6 0 0)) (.cse16 (= (select .cse59 0) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (or (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 v_DerPreprocessor_46) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|)) (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse1 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 .cse4) (= .cse6 .cse4) (= v_DerPreprocessor_45 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))))))))) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45))) (and (= (select v_DerPreprocessor_45 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_43 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse9 (exists ((v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| .cse7))) (and (= (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_46) (= .cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (not (and (or (exists ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse11) (= v_DerPreprocessor_80 .cse11) (= .cse12 v_DerPreprocessor_79) (= .cse6 .cse12))))) .cse9) .cse15 .cse16 .cse17 .cse18 .cse19)) (not (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 0 0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_8 .cse20) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_7) (= .cse22 .cse20) (= .cse2 .cse22) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select v_DerPreprocessor_12 0) 0) (= v_DerPreprocessor_11 .cse22))))))) .cse9) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse26 0 0)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_8 .cse24) (= .cse25 v_DerPreprocessor_7) (= v_DerPreprocessor_12 (store .cse25 0 0)) (= .cse26 .cse24) (= .cse25 .cse6) (= .cse25 .cse27))))) (= .cse2 .cse26) (= .cse27 v_DerPreprocessor_10) (= v_DerPreprocessor_11 .cse26)))))) .cse30)) (not (and .cse30 .cse16 .cse31 .cse17 .cse32 (= (select .cse6 0) 6) .cse19)) .cse30 (not (and .cse0 (or (and (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (and (= v_DerPreprocessor_115 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 .cse2) (= (select v_DerPreprocessor_114 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_112 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse34 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))))))) .cse9) (exists ((v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_112 (Array Int Int)) (v_DerPreprocessor_113 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_112) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_113) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_114))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse36 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse36) (exists ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_115) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_116) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~c~0#1.offset| 0)))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_115 .cse37) (= .cse36 .cse37) (= .cse38 (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= .cse38 .cse2) (= v_DerPreprocessor_112 .cse36) (= v_DerPreprocessor_114 (store .cse36 |c_ULTIMATE.start_main_~c~0#1.offset| 0))))))) .cse15 .cse18 .cse19)) .cse15 .cse16 (or (and (or (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (store .cse41 0 0))) (and (= (select .cse41 0) 0) (= v_DerPreprocessor_61 .cse42) (= .cse2 .cse41) (= .cse42 .cse43) (= .cse6 .cse43) (= v_DerPreprocessor_63 .cse43)))))) (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_63))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse47 (store .cse45 0 0))) (and (= .cse2 .cse45) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse47) (= .cse6 .cse47) (= v_DerPreprocessor_63 .cse47))))))) .cse16) (and (or (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_60))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_58 .cse48) (= .cse2 (select .cse49 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse6 .cse48) (= v_DerPreprocessor_60 (store .cse48 0 0)))))) .cse9) .cse16)) .cse31 .cse17 (not .cse9) .cse32 (not (and .cse30 (or (and (or (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse51 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse50) (= .cse51 v_DerPreprocessor_109) (= .cse2 .cse50) (= .cse6 .cse51))))) .cse9 (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse54 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse53) (= (select .cse53 0) 0) (= .cse54 v_DerPreprocessor_109) (= .cse2 .cse53) (= .cse6 .cse54)))))) .cse16) (and (or (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (and (= .cse2 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (exists ((v_DerPreprocessor_106 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_106) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_107) |c_ULTIMATE.start_main_~c~0#1.base| .cse14))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store .cse57 0 0) .cse6) (= .cse2 .cse57) (= (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) .cse16)) .cse15 .cse17 .cse18 .cse19)) .cse18 .cse19)))) is different from true [2024-11-13 21:26:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 89 states and 294 transitions. [2024-11-13 21:26:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 294 transitions. [2024-11-13 21:26:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:26:58,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:26:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:58,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 21:26:58,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:26:58,626 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 14 treesize of output 12 [2024-11-13 21:26:58,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:26:58,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:26:58,709 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 21:26:58,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 21:26:58,716 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 [2024-11-13 21:26:58,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:26:58,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:26:58,788 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:26:58,806 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:26:58,843 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 25 treesize of output 27 [2024-11-13 21:26:58,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:26:58,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:27:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:27:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 89 states and 294 transitions. [2024-11-13 21:27:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 294 transitions. [2024-11-13 21:27:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:27:00,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:27:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:01,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 21:27:01,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:27:01,508 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:27:01,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 21:27:01,528 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 [2024-11-13 21:27:01,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:01,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 21:27:01,635 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 [2024-11-13 21:27:01,668 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 [2024-11-13 21:27:01,765 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:01,766 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2024-11-13 21:27:02,146 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:02,147 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2024-11-13 21:27:02,331 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:02,332 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 351 [2024-11-13 21:27:02,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:02,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:02,723 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 21:27:02,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 104 [2024-11-13 21:27:02,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:02,824 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 52 treesize of output 26 [2024-11-13 21:27:02,975 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:02,975 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 149 [2024-11-13 21:27:03,156 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 14 treesize of output 12 [2024-11-13 21:27:03,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:03,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:03,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:03,322 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:03,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:27:03,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2024-11-13 21:27:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:27:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 89 states and 294 transitions. [2024-11-13 21:27:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 294 transitions. [2024-11-13 21:27:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:27:03,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:27:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:03,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 21:27:03,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:27:04,053 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:27:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:27:04,070 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 [2024-11-13 21:27:04,150 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 [2024-11-13 21:27:04,179 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 [2024-11-13 21:27:04,243 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 [2024-11-13 21:27:04,394 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:04,395 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 157 [2024-11-13 21:27:04,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:04,803 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-13 21:27:04,804 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 6 case distinctions, treesize of input 144 treesize of output 134 [2024-11-13 21:27:04,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:04,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:05,018 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-11-13 21:27:05,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 85 [2024-11-13 21:27:05,121 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 [2024-11-13 21:27:05,145 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 21:27:05,219 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:05,220 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 351 [2024-11-13 21:27:05,703 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:05,703 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-13 21:27:05,733 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:05,734 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2024-11-13 21:27:05,778 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:05,778 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 21:27:05,832 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 14 treesize of output 12 [2024-11-13 21:27:05,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:05,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:05,912 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:05,936 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:05,970 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 25 treesize of output 27 [2024-11-13 21:27:06,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:06,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-13 21:27:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:27:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 89 states and 294 transitions. [2024-11-13 21:27:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 294 transitions. [2024-11-13 21:27:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:27:06,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:27:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 21:27:06,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:27:06,325 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 21:27:06,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 21:27:06,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:06,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:06,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2024-11-13 21:27:06,357 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 [2024-11-13 21:27:07,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:07,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:08,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:08,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 21:27:08,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-13 21:27:08,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2024-11-13 21:27:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:27:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 89 states and 294 transitions. [2024-11-13 21:27:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 294 transitions. [2024-11-13 21:27:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:27:10,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:27:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:10,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 21:27:10,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:27:10,677 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 21:27:10,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 21:27:10,695 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 [2024-11-13 21:27:10,713 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 [2024-11-13 21:27:10,742 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 [2024-11-13 21:27:10,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 21:27:10,927 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:10,928 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2024-11-13 21:27:11,165 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:11,166 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 199 [2024-11-13 21:27:11,426 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:11,426 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 121 [2024-11-13 21:27:11,479 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:11,479 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2024-11-13 21:27:11,620 INFO L349 Elim1Store]: treesize reduction 44, result has 36.2 percent of original size [2024-11-13 21:27:11,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 210 [2024-11-13 21:27:11,667 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:11,675 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:11,737 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:11,778 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:12,324 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:12,325 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:12,352 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 21:27:12,454 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,455 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2024-11-13 21:27:12,471 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,472 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 151 [2024-11-13 21:27:12,529 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,530 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 151 [2024-11-13 21:27:12,582 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,583 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 220 [2024-11-13 21:27:12,670 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,670 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 121 [2024-11-13 21:27:12,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:12,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:12,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2024-11-13 21:27:12,709 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,709 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2024-11-13 21:27:12,714 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 21:27:12,715 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 190 [2024-11-13 21:27:12,785 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 [2024-11-13 21:27:12,867 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 [2024-11-13 21:27:13,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 21:27:13,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 21:27:13,046 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 59 [2024-11-13 21:27:13,088 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 [2024-11-13 21:27:13,242 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 14 treesize of output 12