./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s3lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/s3lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:07:03,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:07:03,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:07:03,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:07:03,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:07:03,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:07:03,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:07:03,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:07:03,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:07:03,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:07:03,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:07:03,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:07:03,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:07:03,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:07:03,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:07:03,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:07:03,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:07:03,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:07:03,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:07:03,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:07:03,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:07:03,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:07:03,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:07:03,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:07:03,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:07:03,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:07:03,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:07:03,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:07:03,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:07:03,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:07:03,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:07:03,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:07:03,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:07:03,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:07:03,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:07:03,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:07:03,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:07:03,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:07:03,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:07:03,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:07:03,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:07:03,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:07:03,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:07:03,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:07:03,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:07:03,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:07:03,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:07:03,864 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:07:03,865 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:07:03,865 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:07:03,865 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:07:03,865 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:07:03,866 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:07:03,866 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:07:03,867 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:07:03,867 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:07:03,867 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:07:03,867 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:07:03,867 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:07:03,868 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:07:03,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:07:03,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:07:03,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:07:03,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:07:03,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:07:03,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:07:03,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:07:03,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:07:03,870 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:07:03,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:07:03,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:07:03,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:07:03,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:07:03,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:07:03,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:07:03,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:07:03,872 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:07:03,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:07:03,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:07:03,872 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:07:03,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:07:03,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:07:03,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:07:03,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a [2022-11-03 02:07:04,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:07:04,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:07:04,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:07:04,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:07:04,202 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:07:04,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/s3lif.c [2022-11-03 02:07:04,264 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/data/ab2dbb292/17eee2b1d5244d168d3882492be6e6b5/FLAG75721e9b6 [2022-11-03 02:07:04,712 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:07:04,712 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/sv-benchmarks/c/array-fpi/s3lif.c [2022-11-03 02:07:04,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/data/ab2dbb292/17eee2b1d5244d168d3882492be6e6b5/FLAG75721e9b6 [2022-11-03 02:07:05,111 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/data/ab2dbb292/17eee2b1d5244d168d3882492be6e6b5 [2022-11-03 02:07:05,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:07:05,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:07:05,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:07:05,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:07:05,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:07:05,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3693f964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05, skipping insertion in model container [2022-11-03 02:07:05,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:07:05,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:07:05,324 WARN L230 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_9aec42fc-d671-44fb-989e-c85c9d7f27b0/sv-benchmarks/c/array-fpi/s3lif.c[588,601] [2022-11-03 02:07:05,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:07:05,354 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:07:05,371 WARN L230 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_9aec42fc-d671-44fb-989e-c85c9d7f27b0/sv-benchmarks/c/array-fpi/s3lif.c[588,601] [2022-11-03 02:07:05,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:07:05,392 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:07:05,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05 WrapperNode [2022-11-03 02:07:05,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:07:05,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:07:05,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:07:05,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:07:05,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,444 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-03 02:07:05,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:07:05,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:07:05,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:07:05,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:07:05,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,496 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:07:05,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:07:05,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:07:05,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:07:05,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (1/1) ... [2022-11-03 02:07:05,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:07:05,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:07:05,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:07:05,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:07:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:07:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:07:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:07:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:07:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:07:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:07:05,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:07:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:07:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:07:05,688 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:07:05,690 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:07:05,873 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:07:05,925 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:07:05,926 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:07:05,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:07:05 BoogieIcfgContainer [2022-11-03 02:07:05,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:07:05,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:07:05,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:07:05,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:07:05,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:07:05" (1/3) ... [2022-11-03 02:07:05,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad290c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:07:05, skipping insertion in model container [2022-11-03 02:07:05,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:07:05" (2/3) ... [2022-11-03 02:07:05,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad290c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:07:05, skipping insertion in model container [2022-11-03 02:07:05,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:07:05" (3/3) ... [2022-11-03 02:07:05,938 INFO L112 eAbstractionObserver]: Analyzing ICFG s3lif.c [2022-11-03 02:07:05,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:07:05,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:07:06,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:07:06,076 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78ffa613, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:07:06,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:07:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:07:06,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:06,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:06,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -535561234, now seen corresponding path program 1 times [2022-11-03 02:07:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:06,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871142364] [2022-11-03 02:07:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:06,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:06,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871142364] [2022-11-03 02:07:06,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871142364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:07:06,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:07:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:07:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204283552] [2022-11-03 02:07:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:07:06,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:07:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:06,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:07:06,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:07:06,647 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:06,731 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-11-03 02:07:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:07:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 02:07:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:06,742 INFO L225 Difference]: With dead ends: 20 [2022-11-03 02:07:06,742 INFO L226 Difference]: Without dead ends: 9 [2022-11-03 02:07:06,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:07:06,748 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:06,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:07:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-03 02:07:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-03 02:07:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-11-03 02:07:06,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2022-11-03 02:07:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:06,781 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-11-03 02:07:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-11-03 02:07:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:07:06,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:06,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:06,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:07:06,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:06,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 344823405, now seen corresponding path program 1 times [2022-11-03 02:07:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:06,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553998593] [2022-11-03 02:07:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:06,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:06,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553998593] [2022-11-03 02:07:06,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553998593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:07:06,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:07:06,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:07:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542399727] [2022-11-03 02:07:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:07:06,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:07:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:07:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:07:06,961 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:07,013 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-11-03 02:07:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:07:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:07:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:07,014 INFO L225 Difference]: With dead ends: 15 [2022-11-03 02:07:07,014 INFO L226 Difference]: Without dead ends: 11 [2022-11-03 02:07:07,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:07:07,017 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:07,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:07:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-03 02:07:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-03 02:07:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-03 02:07:07,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2022-11-03 02:07:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:07,022 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-03 02:07:07,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-03 02:07:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:07:07,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:07,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:07,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:07:07,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 750922709, now seen corresponding path program 1 times [2022-11-03 02:07:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:07,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958968870] [2022-11-03 02:07:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:08,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958968870] [2022-11-03 02:07:08,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958968870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:07:08,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138560498] [2022-11-03 02:07:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:07:08,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:07:08,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:07:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:08,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:07:08,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:07:08,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:07:08,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:07:09,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-03 02:07:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 [2022-11-03 02:07:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-03 02:07:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:09,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:07:09,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (let ((.cse1 (= .cse5 1)) (.cse0 (* c_~N~0 4))) (and (or (forall ((v_ArrVal_51 (Array Int Int))) (= .cse0 (+ (select v_ArrVal_51 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse1) (or (not .cse1) (= (let ((.cse2 (store .cse3 .cse4 (+ 3 .cse5)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse0)))))) is different from false [2022-11-03 02:07:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:07:09,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138560498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:07:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199981178] [2022-11-03 02:07:09,718 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:07:09,718 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:07:09,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:07:09,727 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:07:09,728 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:07:09,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,877 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:07:09,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:07:09,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:07:09,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:09,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:07:10,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:10,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:10,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:07:10,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:10,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:10,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:10,229 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:07:10,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:07:10,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:07:10,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:07:10,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:07:10,473 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:07:10,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:07:10,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:07:10,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 182 treesize of output 151 [2022-11-03 02:07:10,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 193 treesize of output 179 [2022-11-03 02:07:10,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:10,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 168 [2022-11-03 02:07:10,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:07:10,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:07:10,738 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:07:10,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 02:07:10,822 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:07:10,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:07:10,860 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:07:11,366 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '177#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:07:11,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:07:11,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:07:11,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-03 02:07:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248302657] [2022-11-03 02:07:11,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:07:11,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:07:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:11,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:07:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2022-11-03 02:07:11,370 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:11,525 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-03 02:07:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:07:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:07:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:11,527 INFO L225 Difference]: With dead ends: 19 [2022-11-03 02:07:11,527 INFO L226 Difference]: Without dead ends: 16 [2022-11-03 02:07:11,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2022-11-03 02:07:11,529 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:11,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-11-03 02:07:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-03 02:07:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-11-03 02:07:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-03 02:07:11,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2022-11-03 02:07:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:11,534 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-03 02:07:11,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-03 02:07:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:07:11,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:11,535 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:11,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:07:11,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:11,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1803519565, now seen corresponding path program 2 times [2022-11-03 02:07:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:11,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530003790] [2022-11-03 02:07:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:11,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530003790] [2022-11-03 02:07:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530003790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:07:11,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792531780] [2022-11-03 02:07:11,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:07:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:07:11,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:07:11,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:07:11,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:07:11,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:07:11,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:07:11,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:07:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:11,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:07:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:11,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792531780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:07:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1576474851] [2022-11-03 02:07:12,010 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:07:12,010 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:07:12,011 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:07:12,011 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:07:12,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:07:12,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:07:12,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,121 INFO L356 Elim1Store]: treesize reduction 71, result has 30.4 percent of original size [2022-11-03 02:07:12,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2022-11-03 02:07:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,235 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:07:12,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:07:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:07:12,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:12,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:12,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:12,420 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:07:12,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:07:12,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:07:12,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:07:12,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:07:12,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:07:12,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 120 [2022-11-03 02:07:12,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 52 [2022-11-03 02:07:12,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-11-03 02:07:12,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2022-11-03 02:07:12,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:07:12,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:07:12,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:12,743 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:07:12,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 02:07:12,807 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:07:12,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:07:12,866 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:07:13,246 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '308#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:07:13,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:07:13,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:07:13,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-03 02:07:13,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630168283] [2022-11-03 02:07:13,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:07:13,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:07:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:07:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:07:13,249 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:13,352 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-11-03 02:07:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:07:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:07:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:13,353 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:07:13,353 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 02:07:13,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:07:13,354 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:13,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:07:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 02:07:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2022-11-03 02:07:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-11-03 02:07:13,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2022-11-03 02:07:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:13,363 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-11-03 02:07:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-11-03 02:07:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:07:13,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:13,364 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:13,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:13,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1075573514, now seen corresponding path program 3 times [2022-11-03 02:07:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:13,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593940116] [2022-11-03 02:07:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:13,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593940116] [2022-11-03 02:07:13,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593940116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:07:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747226783] [2022-11-03 02:07:13,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:07:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:07:13,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:07:13,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:07:13,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:07:13,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:07:13,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:07:13,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:07:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:13,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:07:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:07:13,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747226783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:07:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523739824] [2022-11-03 02:07:13,860 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:07:13,860 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:07:13,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:07:13,862 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:07:13,862 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:07:13,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:13,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:13,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:13,973 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:07:13,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:07:13,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:13,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:13,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:07:14,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:14,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:07:14,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:14,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:14,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:07:14,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:14,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:14,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:14,211 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:07:14,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:07:14,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:07:14,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:07:14,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:07:14,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:07:14,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 120 [2022-11-03 02:07:14,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-11-03 02:07:14,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 85 [2022-11-03 02:07:14,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2022-11-03 02:07:14,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:07:14,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:07:14,518 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:07:14,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 02:07:14,589 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:07:14,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:07:14,621 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:07:14,963 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '462#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:07:14,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:07:14,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:07:14,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-03 02:07:14,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435607540] [2022-11-03 02:07:14,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:07:14,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:07:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:07:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:07:14,966 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:15,080 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-03 02:07:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:07:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:07:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:15,081 INFO L225 Difference]: With dead ends: 19 [2022-11-03 02:07:15,081 INFO L226 Difference]: Without dead ends: 14 [2022-11-03 02:07:15,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:07:15,082 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:15,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:07:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-03 02:07:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-03 02:07:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-03 02:07:15,087 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2022-11-03 02:07:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-03 02:07:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-03 02:07:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:07:15,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:15,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:15,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:15,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:15,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 135501902, now seen corresponding path program 4 times [2022-11-03 02:07:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:07:15,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873177995] [2022-11-03 02:07:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:07:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:16,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:07:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873177995] [2022-11-03 02:07:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873177995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:07:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208228471] [2022-11-03 02:07:16,504 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:07:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:16,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:07:16,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:07:16,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:07:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:16,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:07:16,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:07:16,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:07:16,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:07:16,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:07:16,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:16,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-11-03 02:07:16,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2022-11-03 02:07:16,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:16,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:16,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2022-11-03 02:07:16,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-11-03 02:07:16,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 89 [2022-11-03 02:07:16,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:16,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:16,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2022-11-03 02:07:17,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 [2022-11-03 02:07:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:17,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 47 treesize of output 37 [2022-11-03 02:07:17,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:17,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:17,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-11-03 02:07:17,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:17,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2022-11-03 02:07:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:17,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:07:17,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select .cse12 .cse13))) (let ((.cse0 (= .cse14 1)) (.cse1 (* c_~N~0 4)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_182 (Array Int Int))) (= .cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_182))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_182 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse5))))))) (or (not .cse0) (= .cse1 (let ((.cse11 (store .cse12 .cse13 (+ 3 .cse14)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse10))))))))))) is different from false [2022-11-03 02:07:17,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:07:17,684 INFO L356 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2022-11-03 02:07:17,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 273 treesize of output 152 [2022-11-03 02:07:56,469 WARN L234 SmtUtils]: Spent 18.30s on a formula simplification. DAG size of input: 91 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:07:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:07:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208228471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:07:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384642778] [2022-11-03 02:07:58,374 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:07:58,375 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:07:58,375 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:07:58,375 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:07:58,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:07:58,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:58,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:58,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:58,543 INFO L244 Elim1Store]: Index analysis took 103 ms [2022-11-03 02:07:59,176 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:07:59,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:07:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:07:59,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:07:59,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 02:07:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:07:59,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:07:59,721 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 02:07:59,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 02:07:59,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:07:59,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:07:59,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:08:00,279 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:08:00,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:08:00,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 189 treesize of output 171 [2022-11-03 02:08:00,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:08:00,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 151 [2022-11-03 02:08:00,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:08:00,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 158 [2022-11-03 02:08:00,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:08:00,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:08:01,007 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:08:01,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 02:08:01,400 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:08:01,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:08:01,456 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:08:05,024 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '626#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:08:05,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:08:05,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:08:05,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2022-11-03 02:08:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60112377] [2022-11-03 02:08:05,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:08:05,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:08:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:08:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:08:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=873, Unknown=8, NotChecked=60, Total=1056 [2022-11-03 02:08:05,028 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:08:06,413 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-11-03 02:08:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:08:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:08:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:08:06,415 INFO L225 Difference]: With dead ends: 24 [2022-11-03 02:08:06,415 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:08:06,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=131, Invalid=986, Unknown=9, NotChecked=64, Total=1190 [2022-11-03 02:08:06,417 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:08:06,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 27 Unchecked, 0.4s Time] [2022-11-03 02:08:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:08:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-11-03 02:08:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-03 02:08:06,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-11-03 02:08:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:08:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-03 02:08:06,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-03 02:08:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:08:06,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:06,428 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:08:06,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:08:06,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:08:06,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:08:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash -94656268, now seen corresponding path program 5 times [2022-11-03 02:08:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:08:06,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114483879] [2022-11-03 02:08:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:08:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:07,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:08:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114483879] [2022-11-03 02:08:07,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114483879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:08:07,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352473090] [2022-11-03 02:08:07,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:08:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:08:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:08:07,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:08:07,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:08:07,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:08:07,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:08:07,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:08:07,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:08,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:08:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:08,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352473090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:08:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92828463] [2022-11-03 02:08:08,506 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:08:08,507 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:08:08,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:08:08,507 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:08:08,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:08:08,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:08,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,022 INFO L356 Elim1Store]: treesize reduction 71, result has 30.4 percent of original size [2022-11-03 02:08:09,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2022-11-03 02:08:09,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:08:09,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,639 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:08:09,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:08:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 02:08:09,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:09,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:09,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:10,055 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 02:08:10,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 02:08:10,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:08:10,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:08:10,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:08:10,541 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:08:10,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:08:10,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:08:10,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 185 treesize of output 156 [2022-11-03 02:08:10,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 195 treesize of output 179 [2022-11-03 02:08:10,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:08:10,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 179 treesize of output 176 [2022-11-03 02:08:10,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:08:10,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:08:11,162 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:08:11,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 02:08:11,534 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:08:11,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:08:11,583 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:08:13,994 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '799#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:08:13,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:08:13,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:08:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-03 02:08:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627128815] [2022-11-03 02:08:13,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:08:13,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:08:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:08:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:08:13,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:08:13,997 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:08:14,833 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-11-03 02:08:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:08:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:08:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:08:14,834 INFO L225 Difference]: With dead ends: 39 [2022-11-03 02:08:14,835 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:08:14,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:08:14,836 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:08:14,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:08:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:08:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-11-03 02:08:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 02:08:14,844 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2022-11-03 02:08:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:08:14,845 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 02:08:14,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 02:08:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:08:14,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:14,846 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:08:14,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 02:08:15,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:08:15,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:08:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -72804467, now seen corresponding path program 6 times [2022-11-03 02:08:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:08:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161947606] [2022-11-03 02:08:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:08:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:15,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:08:15,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161947606] [2022-11-03 02:08:15,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161947606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:08:15,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532461545] [2022-11-03 02:08:15,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:08:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:08:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:08:15,614 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:08:15,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:08:15,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:08:15,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:08:15,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:08:15,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:16,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:08:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:08:16,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532461545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:08:16,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422541802] [2022-11-03 02:08:16,696 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:08:16,696 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:08:16,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:08:16,697 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:08:16,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:08:16,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:16,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,196 INFO L356 Elim1Store]: treesize reduction 71, result has 30.4 percent of original size [2022-11-03 02:08:17,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2022-11-03 02:08:17,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:08:17,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,831 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:08:17,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:08:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:17,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:08:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:18,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:18,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:18,334 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:08:18,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:08:18,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:08:18,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:08:18,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:08:18,928 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:08:18,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:08:18,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 161 [2022-11-03 02:08:19,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:08:19,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 158 [2022-11-03 02:08:19,181 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:08:19,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 141 [2022-11-03 02:08:19,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:08:19,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:08:19,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:19,510 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:08:19,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 02:08:19,875 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:08:19,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:08:19,919 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:08:22,179 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '998#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:08:22,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:08:22,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:08:22,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-03 02:08:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644764593] [2022-11-03 02:08:22,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:08:22,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:08:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:08:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:08:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:08:22,181 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:08:23,027 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-11-03 02:08:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:08:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:08:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:08:23,029 INFO L225 Difference]: With dead ends: 23 [2022-11-03 02:08:23,029 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:08:23,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:08:23,030 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:08:23,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:08:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:08:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:08:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-03 02:08:23,037 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-11-03 02:08:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:08:23,037 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-03 02:08:23,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-03 02:08:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:08:23,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:23,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:08:23,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:08:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:08:23,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:08:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 852519669, now seen corresponding path program 7 times [2022-11-03 02:08:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:08:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133910033] [2022-11-03 02:08:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:08:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:08:28,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:08:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133910033] [2022-11-03 02:08:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133910033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:08:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94011318] [2022-11-03 02:08:28,548 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:08:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:08:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:08:28,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:08:28,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:08:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:28,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 02:08:28,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:28,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:08:28,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:08:28,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:08:28,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:28,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2022-11-03 02:08:29,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:29,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:29,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:29,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:08:29,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:29,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:29,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 52 [2022-11-03 02:08:30,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:30,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:30,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 55 [2022-11-03 02:08:30,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:30,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:30,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 62 [2022-11-03 02:08:31,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:31,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:31,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:31,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2022-11-03 02:08:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:32,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:32,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2022-11-03 02:08:32,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:32,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:32,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:32,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:08:32,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 65 [2022-11-03 02:08:33,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:33,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:08:33,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 39 [2022-11-03 02:08:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:08:33,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:08:35,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16))) (let ((.cse0 (= .cse17 1)) (.cse1 (* c_~N~0 4)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_366 (Array Int Int))) (= .cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_366))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_366 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6)))))))) (or (not .cse0) (= .cse1 (let ((.cse14 (store .cse15 .cse16 (+ 3 .cse17)))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse11 .cse12 .cse13)))))))))))) is different from false [2022-11-03 02:08:36,191 INFO L356 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2022-11-03 02:08:36,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 617 treesize of output 274 [2022-11-03 02:08:36,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:09:16,127 WARN L234 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 113 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:09:16,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:09:16,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:09:19,453 INFO L356 Elim1Store]: treesize reduction 40, result has 64.9 percent of original size [2022-11-03 02:09:19,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1934 treesize of output 555 [2022-11-03 02:09:23,253 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse39 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse48 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (* c_~N~0 4)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse49 (select .cse47 .cse48))) (let ((.cse40 (= .cse49 1)) (.cse38 (forall ((v_ArrVal_366 (Array Int Int))) (= .cse1 (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_366))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select v_ArrVal_366 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse56 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse52 .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse56)))))))) (.cse15 (+ .cse39 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (let ((.cse0 (= (+ .cse39 4) 0)) (.cse16 (= (+ .cse39 8) 0))) (and (or (not .cse0) (forall ((v_arrayElimArr_19 (Array Int Int))) (= .cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_19))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_arrayElimArr_19 .cse9))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))) (or (forall ((v_arrayElimArr_19 (Array Int Int))) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_19))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select v_arrayElimArr_19 .cse15))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14))))) .cse1)) (not .cse16)) (or (and (forall ((v_arrayElimArr_19 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_19))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (let ((.cse18 (select v_arrayElimArr_19 .cse9))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse17 .cse18 .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (= (let ((.cse23 (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse17 .cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse23))) .cse1) (= (let ((.cse25 (select v_arrayElimArr_19 .cse15))) (let ((.cse24 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse24 .cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse17 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse25))) .cse1)))))) (or (forall ((v_arrayElimArr_19 (Array Int Int))) (= (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_19))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse30 (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse26 .cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse30))))) .cse1)) .cse0) (forall ((v_arrayElimArr_19 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_19))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (let ((.cse32 (select v_arrayElimArr_19 .cse9))) (let ((.cse33 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse31 .cse32 .cse33 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (= (let ((.cse37 (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse31 .cse36 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse37))) .cse1))))))) .cse16) .cse38)) .cse40) (or (not .cse40) (let ((.cse50 (select .cse47 .cse9)) (.cse51 (select .cse47 .cse15))) (and (= (let ((.cse46 (store (store (store .cse47 .cse48 (+ 3 .cse49)) .cse9 (+ .cse50 3)) .cse15 (+ 3 .cse51)))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse41 .cse42 .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse1) (or (= .cse50 1) .cse38) (or (= .cse51 1) .cse38))))))))) is different from false [2022-11-03 02:09:58,221 WARN L234 SmtUtils]: Spent 23.64s on a formula simplification. DAG size of input: 118 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:10:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:10:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94011318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:06,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453436100] [2022-11-03 02:10:06,932 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:10:06,933 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:06,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:06,933 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:06,934 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:06,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:06,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:10:07,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,635 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:07,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:07,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-03 02:10:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:07,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:08,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:08,240 INFO L356 Elim1Store]: treesize reduction 110, result has 12.0 percent of original size [2022-11-03 02:10:08,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 336 treesize of output 332 [2022-11-03 02:10:08,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:10:08,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:10:08,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:10:08,825 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:10:08,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:10:08,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:10:08,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 167 treesize of output 143 [2022-11-03 02:10:09,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 165 [2022-11-03 02:10:09,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:10:09,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 165 treesize of output 166 [2022-11-03 02:10:09,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:10:09,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:10:09,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:09,533 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:10:09,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 02:10:09,927 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:09,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:10:09,984 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:16,383 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1202#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:16,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:16,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:10:16,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2022-11-03 02:10:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771522656] [2022-11-03 02:10:16,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:10:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:10:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1207, Unknown=9, NotChecked=142, Total=1482 [2022-11-03 02:10:16,386 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:22,697 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-03 02:10:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:10:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:10:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:22,698 INFO L225 Difference]: With dead ends: 29 [2022-11-03 02:10:22,698 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:10:22,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 100.4s TimeCoverageRelationStatistics Valid=124, Invalid=1207, Unknown=9, NotChecked=142, Total=1482 [2022-11-03 02:10:22,700 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:22,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 70 Unchecked, 2.8s Time] [2022-11-03 02:10:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:10:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-11-03 02:10:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-03 02:10:22,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-03 02:10:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:22,711 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-03 02:10:22,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-03 02:10:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:10:22,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:22,712 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:22,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:22,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 658058029, now seen corresponding path program 8 times [2022-11-03 02:10:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:22,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130112324] [2022-11-03 02:10:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:23,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130112324] [2022-11-03 02:10:23,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130112324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:10:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45673651] [2022-11-03 02:10:23,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:10:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:23,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:23,915 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:23,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:10:24,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:10:24,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:24,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:10:24,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:24,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45673651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604177227] [2022-11-03 02:10:25,555 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:10:25,555 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:25,556 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:25,556 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:25,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:25,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:25,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,231 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:26,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:26,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:10:26,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:10:26,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:26,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:26,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:26,895 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:10:26,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:10:27,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:10:27,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:10:27,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:10:27,515 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:10:27,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:10:27,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 165 [2022-11-03 02:10:27,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:10:27,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 165 treesize of output 166 [2022-11-03 02:10:27,838 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:10:27,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 167 treesize of output 133 [2022-11-03 02:10:27,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:10:27,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:10:28,304 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:28,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-03 02:10:28,735 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:28,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:10:28,793 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:32,328 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1412#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:32,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:32,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:10:32,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-03 02:10:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530824393] [2022-11-03 02:10:32,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:10:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:10:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:10:32,330 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:33,413 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-11-03 02:10:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:10:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:10:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:33,414 INFO L225 Difference]: With dead ends: 46 [2022-11-03 02:10:33,414 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 02:10:33,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:10:33,416 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:33,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:10:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 02:10:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-11-03 02:10:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-03 02:10:33,428 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2022-11-03 02:10:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:33,428 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-03 02:10:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-03 02:10:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:10:33,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:33,429 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:33,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:33,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:10:33,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1425223510, now seen corresponding path program 9 times [2022-11-03 02:10:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:33,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220345917] [2022-11-03 02:10:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:34,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220345917] [2022-11-03 02:10:34,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220345917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:10:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000048473] [2022-11-03 02:10:34,580 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:10:34,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:34,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:34,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:10:34,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:10:34,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:34,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:10:34,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:35,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:10:36,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000048473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054816085] [2022-11-03 02:10:36,177 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 02:10:36,177 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:36,178 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:36,178 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:36,178 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:36,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:10:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,903 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:36,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:36,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:36,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:37,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:37,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 02:10:37,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:37,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:37,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:37,602 INFO L356 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2022-11-03 02:10:37,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 333 [2022-11-03 02:10:37,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 02:10:37,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-03 02:10:37,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-03 02:10:38,319 INFO L356 Elim1Store]: treesize reduction 32, result has 53.6 percent of original size [2022-11-03 02:10:38,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 135 [2022-11-03 02:10:38,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 175 treesize of output 159 [2022-11-03 02:10:38,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:10:38,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 156 [2022-11-03 02:10:38,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:10:38,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 150 [2022-11-03 02:10:38,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 18 [2022-11-03 02:10:38,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 19 [2022-11-03 02:10:38,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:39,053 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:10:39,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-03 02:10:39,458 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:39,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-03 02:10:39,513 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:42,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1656#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= (* ~N~0 4) |ULTIMATE.start_main_#t~mem14#1|) 1 0)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:42,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:42,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:10:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-03 02:10:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099462095] [2022-11-03 02:10:42,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:42,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:10:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:10:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:10:42,568 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:43,805 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-11-03 02:10:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:10:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:10:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:43,807 INFO L225 Difference]: With dead ends: 27 [2022-11-03 02:10:43,807 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:10:43,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:10:43,809 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:43,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:10:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:10:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-03 02:10:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-03 02:10:43,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-11-03 02:10:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:43,817 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-03 02:10:43,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-03 02:10:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:10:43,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:43,819 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:43,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:44,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:10:44,027 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 400940206, now seen corresponding path program 10 times [2022-11-03 02:10:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873129588] [2022-11-03 02:10:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:54,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873129588] [2022-11-03 02:10:54,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873129588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:10:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698510583] [2022-11-03 02:10:54,034 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:10:54,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:54,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:54,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aec42fc-d671-44fb-989e-c85c9d7f27b0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:10:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:54,163 WARN L261 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-03 02:10:54,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:54,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:10:54,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:54,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:10:54,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:54,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-11-03 02:10:55,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2022-11-03 02:10:55,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:10:57,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2022-11-03 02:10:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:57,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 76 [2022-11-03 02:10:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-11-03 02:10:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 118 [2022-11-03 02:10:57,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2022-11-03 02:10:57,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-11-03 02:10:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:58,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 152 [2022-11-03 02:10:58,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 76 [2022-11-03 02:10:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:58,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2022-11-03 02:10:59,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-03 02:11:00,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:00,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:00,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-03 02:11:01,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-03 02:11:02,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-11-03 02:11:02,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-03 02:11:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:03,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2022-11-03 02:11:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:03,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:28,365 WARN L234 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:11:55,478 WARN L234 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 104 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:12:03,587 WARN L234 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 44 DAG size of output: 38 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:12:03,588 INFO L356 Elim1Store]: treesize reduction 38, result has 65.5 percent of original size [2022-11-03 02:12:03,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3304 treesize of output 1040 [2022-11-03 02:12:28,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:12:35,580 WARN L234 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 44 DAG size of output: 38 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:12:35,580 INFO L356 Elim1Store]: treesize reduction 40, result has 64.9 percent of original size [2022-11-03 02:12:35,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 4150 treesize of output 1047 [2022-11-03 02:12:41,890 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse279 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse298 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse299 (+ .cse279 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* c_~N~0 4)) (.cse300 (select .cse298 .cse299))) (let ((.cse0 (= .cse300 1)) (.cse270 (forall ((v_ArrVal_606 (Array Int Int))) (= (let ((.cse304 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_606))) (let ((.cse305 (select .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse301 (select .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse303 (select v_ArrVal_606 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse306 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse303))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse302 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse303 .cse306))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse301 .cse302 .cse303 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse302 .cse303 .cse306))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse306)))))) .cse10))) (.cse14 (+ .cse279 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse18 (+ .cse279 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 (let ((.cse35 (= (+ .cse279 8) 0))) (let ((.cse42 (= (+ .cse279 4) 0)) (.cse17 (+ .cse10 3)) (.cse19 (not .cse35))) (let ((.cse26 (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse272 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse273 (select .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse271 (select v_arrayElimArr_32 .cse18)) (.cse276 (select .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse271 4) (= (let ((.cse274 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse271 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse275 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse274 .cse271 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse274 .cse271 .cse275 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse274 .cse271 .cse275 .cse276))) .cse10) (= (let ((.cse278 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse277 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse278 .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse277 .cse278 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse277 .cse278 .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse271 .cse276))) .cse17)))))) .cse19)) (.cse58 (not .cse42))) (and (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_arrayElimArr_32 .cse18)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 4) (= (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse4 .cse1 .cse5 .cse6))) .cse10) (= (let ((.cse12 (select v_arrayElimArr_32 .cse14))) (let ((.cse13 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse11 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse6 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 .cse12 .cse6 .cse13 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse6 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse16 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse15 .cse16 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse1 .cse6))) .cse17)))))) .cse19) (or .cse19 (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select v_arrayElimArr_33 .cse18))) (let ((.cse20 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse20 .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse25))))))))) (or (and .cse26 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select v_arrayElimArr_32 .cse18))) (or (= .cse27 4) (= (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse31 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse30 .cse27 .cse31 .cse32))) .cse10) (= (let ((.cse34 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse33 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse33 .cse34 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse27 .cse32))) .cse17) (not (= .cse27 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_32 .cse18))) (or (= .cse36 4) (= (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse37 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse37 .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse36 .cse41)))))) .cse17) (not (= .cse36 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse42) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_32 .cse18))) (or (= .cse43 4) (= (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse46 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse47 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse43 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse43 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse46 .cse43 .cse47 .cse48)))))) .cse10)))) .cse19) (or .cse35 (and (or (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse49 (select v_arrayElimArr_33 .cse14))) (let ((.cse54 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52 .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse52 .cse53 .cse54))))) (= .cse10 (let ((.cse56 (select v_arrayElimArr_33 .cse18))) (let ((.cse55 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse57 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse55 .cse52 .cse56 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse52 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse57)))))))))) .cse58) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse62 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse62 .cse63 .cse64))))) (= .cse10 (let ((.cse65 (select v_arrayElimArr_33 .cse14))) (let ((.cse67 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse66 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse65 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse63 .cse66 .cse67))))) (= .cse10 (let ((.cse69 (select v_arrayElimArr_33 .cse18))) (let ((.cse68 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse70 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse63 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse68 .cse63 .cse69 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse63 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse70)))))))))) (or (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse74 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse75 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse74 .cse75 .cse76)))))))) .cse42) (or (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select v_arrayElimArr_33 .cse14)) (.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse82 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse81 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80 .cse81 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse80 .cse81 .cse82)))))))) .cse58) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse86 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse88 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse86 .cse87 .cse88))))) (= .cse10 (let ((.cse89 (select v_arrayElimArr_33 .cse14))) (let ((.cse91 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse90 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse89 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse87 .cse90 .cse91)))))))))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse98 (select .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse95 (select .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse92 (select v_arrayElimArr_32 .cse18))) (or (= .cse92 4) (= (let ((.cse94 (select v_arrayElimArr_32 .cse14))) (let ((.cse96 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse93 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse93 .cse94 .cse95 .cse96 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse100 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse99 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse99 .cse100 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse99 .cse100 .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse92 .cse95))) .cse17) (not (= .cse92 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse35) .cse26 (or (and (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse105 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse103 (select .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse109 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse102 (select v_arrayElimArr_32 .cse14))) (let ((.cse104 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse101 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse103 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse101 .cse102 .cse103 .cse104 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse102 .cse103 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse108 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse107 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse107 .cse108 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 .cse108 .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse109 .cse103))) .cse17) (not (= .cse109 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (or .cse35 (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse110 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse111 (select .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse113 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse115 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse114 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse112 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse112 .cse113 .cse114 .cse115))))) (= (let ((.cse117 (select v_arrayElimArr_32 .cse14))) (let ((.cse118 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse117 .cse113))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse116 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse117 .cse113 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse116 .cse117 .cse113 .cse118 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse117 .cse113 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse122 (select .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse124 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse123 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse121 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse123 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122 .cse123 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse121 .cse122 .cse123 .cse124))))) (= (let ((.cse126 (select v_arrayElimArr_32 .cse18))) (let ((.cse125 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse126 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse127 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse126 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse126 .cse127 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse125 .cse126 .cse127 .cse122)))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (= .cse10 (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse131 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse133 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse132 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse131 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse130 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse131 .cse132 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse130 .cse131 .cse132 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse130 .cse131 .cse132 .cse133)))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse137 (select .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse139 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse138 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse136 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse138 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse136 .cse137 .cse138 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse136 .cse137 .cse138 .cse139))))) (= (let ((.cse141 (select v_arrayElimArr_32 .cse18))) (let ((.cse140 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse141 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse142 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse140 .cse141 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse140 .cse141 .cse142 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse140 .cse141 .cse142 .cse137)))) .cse10) (= (let ((.cse144 (select v_arrayElimArr_32 .cse14))) (let ((.cse145 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse143 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse137 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse143 .cse144 .cse137 .cse145 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse143 .cse144 .cse137 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse146 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse147 (select .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse151 (select .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse149 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse148 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse150 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse148 .cse149 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse148 .cse149 .cse150 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse148 .cse149 .cse150 .cse151))) .cse10) (= (let ((.cse153 (select v_arrayElimArr_32 .cse14))) (let ((.cse154 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse153 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse152 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse153 .cse151 .cse154))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse152 .cse153 .cse151 .cse154 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse153 .cse151 .cse154))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse156 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse155 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse156 .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse155 .cse156 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse156 .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse149 .cse151))) .cse17) (not (= .cse149 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse157 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse158 (select .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse162 (select .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse160 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse159 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse160 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse161 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse159 .cse160 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse159 .cse160 .cse161 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse159 .cse160 .cse161 .cse162))) .cse10) (= (let ((.cse164 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse163 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse164 .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse163 .cse164 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse163 .cse164 .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse160 .cse162))) .cse17) (not (= .cse160 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse169 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse167 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse168 (select .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse170 (select .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse166 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse165 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse166 .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse165 .cse166 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse165 .cse166 .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse169 .cse170)))))) .cse17) (not (= .cse169 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse19 (forall ((v_arrayElimArr_32 (Array Int Int))) (= (let ((.cse171 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse172 (select .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse174 (select v_arrayElimArr_32 .cse18)) (.cse176 (select .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse173 (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse174 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse175 (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse173 .cse174 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse173 .cse174 .cse175 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse173 .cse174 .cse175 .cse176)))))) .cse10))) (or .cse19 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse177 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse178 (select .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse180 (select v_arrayElimArr_32 .cse18)) (.cse182 (select .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (let ((.cse179 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse180 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse181 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse179 .cse180 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse179 .cse180 .cse181 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse179 .cse180 .cse181 .cse182))) .cse10) (= (let ((.cse184 (select v_arrayElimArr_32 .cse14))) (let ((.cse185 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse184 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse183 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse184 .cse182 .cse185))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse183 .cse184 .cse182 .cse185 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse183 .cse184 .cse182 .cse185))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse187 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse186 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse187 .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse186 .cse187 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse186 .cse187 .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse180 .cse182))) .cse17))))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse188 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse189 (select .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse191 (select v_arrayElimArr_32 .cse18)) (.cse193 (select .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (let ((.cse190 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse191 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse192 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse190 .cse191 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse190 .cse191 .cse192 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse190 .cse191 .cse192 .cse193))) .cse10) (= (let ((.cse195 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse194 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse195 .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse194 .cse195 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse194 .cse195 .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse191 .cse193))) .cse17)))))) .cse19)) .cse42) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (= (select v_arrayElimArr_32 .cse18) 4) (= (let ((.cse200 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse201 (select .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse197 (select v_arrayElimArr_32 .cse14)) (.cse198 (select .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse199 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse197 .cse198))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse196 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse197 .cse198 .cse199))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse196 .cse197 .cse198 .cse199 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse196 .cse197 .cse198 .cse199))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10))) .cse58) (or .cse35 (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse202 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse203 (select .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse207 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse205 (select .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse206 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse205 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse204 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse205 .cse206 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse204 .cse205 .cse206 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse204 .cse205 .cse206 .cse207)))) (= .cse207 1) (= (let ((.cse209 (select v_arrayElimArr_32 .cse14))) (let ((.cse210 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse209 .cse205))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse208 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse209 .cse205 .cse210))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse208 .cse209 .cse205 .cse210 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse208 .cse209 .cse205 .cse210))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (= (let ((.cse215 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse216 (select .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse212 (select v_arrayElimArr_32 .cse14)) (.cse213 (select .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse214 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse212 .cse213))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse211 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse212 .cse213 .cse214))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse211 .cse212 .cse213 .cse214 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse211 .cse212 .cse213 .cse214))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10)) .cse58) (or (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse217 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse218 (select .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse222 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse220 (select .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse221 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse220 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse219 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse220 .cse221 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse219 .cse220 .cse221 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse219 .cse220 .cse221 .cse222)))) (= .cse222 1) (= (let ((.cse224 (select v_arrayElimArr_32 .cse18))) (let ((.cse223 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse224 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse225 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse223 .cse224 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse223 .cse224 .cse225 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse223 .cse224 .cse225 .cse220)))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse231 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse10 (let ((.cse226 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse227 (select .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse229 (select .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse230 (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse229 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse228 (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse229 .cse230 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse228 .cse229 .cse230 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse228 .cse229 .cse230 .cse231))))))) (= .cse231 1))))) .cse42) (or .cse58 (forall ((v_arrayElimArr_32 (Array Int Int))) (or (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (let ((.cse236 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse237 (select .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse233 (select v_arrayElimArr_32 .cse14)) (.cse234 (select .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse235 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse233 .cse234))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse232 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse233 .cse234 .cse235))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse232 .cse233 .cse234 .cse235 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse232 .cse233 .cse234 .cse235))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10)))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse238 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse239 (select .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse243 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse241 (select .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse242 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse241 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse240 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse241 .cse242 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse240 .cse241 .cse242 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse240 .cse241 .cse242 .cse243)))) (= .cse243 1) (= (let ((.cse245 (select v_arrayElimArr_32 .cse18))) (let ((.cse244 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse245 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse246 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse244 .cse245 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse244 .cse245 .cse246 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse244 .cse245 .cse246 .cse241)))) .cse10) (= (let ((.cse248 (select v_arrayElimArr_32 .cse14))) (let ((.cse249 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse248 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse247 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse248 .cse241 .cse249))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse247 .cse248 .cse241 .cse249 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse247 .cse248 .cse241 .cse249))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))))) (or .cse58 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse255 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse256 (select .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse250 (select v_arrayElimArr_32 .cse18)) (.cse253 (select .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse250 4) (= (let ((.cse252 (select v_arrayElimArr_32 .cse14))) (let ((.cse254 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse252 .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse251 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse252 .cse253 .cse254))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse251 .cse252 .cse253 .cse254 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse251 .cse252 .cse253 .cse254))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse258 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse257 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse258 .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse257 .cse258 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse257 .cse258 .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse250 .cse253))) .cse17))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse260 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse261 (select .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse264 (select .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse259 (select v_arrayElimArr_32 .cse18))) (or (= .cse259 4) (= (let ((.cse262 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse259 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse263 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse262 .cse259 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse262 .cse259 .cse263 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse262 .cse259 .cse263 .cse264))) .cse10) (= (let ((.cse266 (select v_arrayElimArr_32 .cse14))) (let ((.cse267 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse266 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse265 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse266 .cse264 .cse267))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse265 .cse266 .cse264 .cse267 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse265 .cse266 .cse264 .cse267))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse269 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse268 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse269 .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse268 .cse269 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse268 .cse269 .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse259 .cse264))) .cse17) (not (= .cse259 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse270))))) (or (not .cse0) (let ((.cse290 (select .cse298 .cse18))) (let ((.cse288 (select .cse298 .cse14)) (.cse287 (store .cse298 .cse299 (+ 3 .cse300))) (.cse289 (+ 3 .cse290))) (and (= .cse10 (let ((.cse286 (store (store .cse287 .cse14 (+ .cse288 3)) .cse18 .cse289))) (let ((.cse280 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse286))) (let ((.cse281 (select .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse282 (select .cse286 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse284 (select .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse283 (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse284))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse285 (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse283 .cse284))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse283 .cse284 .cse285))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse282 .cse283 .cse284 .cse285)))))))) (or (= .cse290 1) .cse270) (or (= .cse288 1) (forall ((v_ArrVal_601 Int)) (= (let ((.cse297 (store (store .cse287 .cse14 v_ArrVal_601) .cse18 .cse289))) (let ((.cse295 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse297))) (let ((.cse296 (select .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse293 (select .cse297 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse294 (select .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse292 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse291 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse292 .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse291 .cse292 .cse293 .cse294 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse291 .cse292 .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) .cse10)))))))))))) is different from false [2022-11-03 02:12:44,124 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse279 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse298 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse299 (+ .cse279 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* c_~N~0 4)) (.cse300 (select .cse298 .cse299))) (let ((.cse0 (= .cse300 1)) (.cse270 (forall ((v_ArrVal_606 (Array Int Int))) (= (let ((.cse304 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_606))) (let ((.cse305 (select .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse301 (select .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse303 (select v_ArrVal_606 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse306 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse303))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse302 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse303 .cse306))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse301 .cse302 .cse303 (select (select (store .cse304 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse305 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse301 .cse302 .cse303 .cse306))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse306)))))) .cse10))) (.cse14 (+ .cse279 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse18 (+ .cse279 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 (let ((.cse35 (= (+ .cse279 8) 0))) (let ((.cse42 (= (+ .cse279 4) 0)) (.cse17 (+ .cse10 3)) (.cse19 (not .cse35))) (let ((.cse26 (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse272 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse273 (select .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse271 (select v_arrayElimArr_32 .cse18)) (.cse276 (select .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse271 4) (= (let ((.cse274 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse271 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse275 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse274 .cse271 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse274 .cse271 .cse275 .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse274 .cse271 .cse275 .cse276))) .cse10) (= (let ((.cse278 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse277 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse278 .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse277 .cse278 (select (select (store .cse272 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse273 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse277 .cse278 .cse271 (- 3) .cse276))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse271 .cse276))) .cse17)))))) .cse19)) (.cse58 (not .cse42))) (and (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_arrayElimArr_32 .cse18)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 4) (= (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse4 .cse1 .cse5 .cse6))) .cse10) (= (let ((.cse12 (select v_arrayElimArr_32 .cse14))) (let ((.cse13 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse11 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse6 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 .cse12 .cse6 .cse13 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse6 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse16 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse15 .cse16 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse1 (- 3) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse1 .cse6))) .cse17)))))) .cse19) (or .cse19 (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select v_arrayElimArr_33 .cse18))) (let ((.cse20 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse20 .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse25))))))))) (or (and .cse26 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select v_arrayElimArr_32 .cse18))) (or (= .cse27 4) (= (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse31 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse30 .cse27 .cse31 .cse32))) .cse10) (= (let ((.cse34 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse33 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse33 .cse34 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse27 (- 3) .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse27 .cse32))) .cse17) (not (= .cse27 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_32 .cse18))) (or (= .cse36 4) (= (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse37 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse37 .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse36 (- 3) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse36 .cse41)))))) .cse17) (not (= .cse36 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse42) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_32 .cse18))) (or (= .cse43 4) (= (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse46 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse47 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse43 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse43 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse46 .cse43 .cse47 .cse48)))))) .cse10)))) .cse19) (or .cse35 (and (or (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse49 (select v_arrayElimArr_33 .cse14))) (let ((.cse54 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse52 .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse52 .cse53 .cse54))))) (= .cse10 (let ((.cse56 (select v_arrayElimArr_33 .cse18))) (let ((.cse55 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse57 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse55 .cse52 .cse56 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse52 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse57)))))))))) .cse58) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse62 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse62 .cse63 .cse64))))) (= .cse10 (let ((.cse65 (select v_arrayElimArr_33 .cse14))) (let ((.cse67 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse66 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse65 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse63 .cse66 .cse67))))) (= .cse10 (let ((.cse69 (select v_arrayElimArr_33 .cse18))) (let ((.cse68 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse70 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse63 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse68 .cse63 .cse69 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse63 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse70)))))))))) (or (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse74 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse75 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse76 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse74 .cse75 .cse76)))))))) .cse42) (or (forall ((v_arrayElimArr_33 (Array Int Int))) (= .cse10 (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse77 (select v_arrayElimArr_33 .cse14)) (.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse82 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse81 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse77 .cse80 .cse81 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse80 .cse81 .cse82)))))))) .cse58) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse86 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse88 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse86 .cse87 .cse88))))) (= .cse10 (let ((.cse89 (select v_arrayElimArr_33 .cse14))) (let ((.cse91 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse90 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse89 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse87 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse87 .cse90 .cse91)))))))))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse98 (select .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse95 (select .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse92 (select v_arrayElimArr_32 .cse18))) (or (= .cse92 4) (= (let ((.cse94 (select v_arrayElimArr_32 .cse14))) (let ((.cse96 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse93 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse93 .cse94 .cse95 .cse96 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse100 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse99 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse99 .cse100 (select (select (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse99 .cse100 .cse92 (- 3) .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse92 .cse95))) .cse17) (not (= .cse92 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse35) .cse26 (or (and (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse105 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse103 (select .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse109 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse102 (select v_arrayElimArr_32 .cse14))) (let ((.cse104 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse101 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse103 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse101 .cse102 .cse103 .cse104 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse102 .cse103 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse108 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse107 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse107 .cse108 (select (select (store .cse105 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 .cse108 .cse109 (- 3) .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse109 .cse103))) .cse17) (not (= .cse109 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (or .cse35 (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse110 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse111 (select .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse113 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse115 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse114 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse112 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse112 .cse113 .cse114 .cse115))))) (= (let ((.cse117 (select v_arrayElimArr_32 .cse14))) (let ((.cse118 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse117 .cse113))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse116 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse117 .cse113 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse116 .cse117 .cse113 .cse118 (select (select (store .cse110 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse117 .cse113 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse122 (select .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse124 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse123 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse121 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse123 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122 .cse123 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse121 .cse122 .cse123 .cse124))))) (= (let ((.cse126 (select v_arrayElimArr_32 .cse18))) (let ((.cse125 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse126 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse127 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse126 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse126 .cse127 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse125 .cse126 .cse127 .cse122)))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (= .cse10 (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse131 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse133 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse132 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse131 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse130 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse131 .cse132 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse130 .cse131 .cse132 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse130 .cse131 .cse132 .cse133)))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse137 (select .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse139 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse138 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse136 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse138 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse136 .cse137 .cse138 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse136 .cse137 .cse138 .cse139))))) (= (let ((.cse141 (select v_arrayElimArr_32 .cse18))) (let ((.cse140 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse141 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse142 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse140 .cse141 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse140 .cse141 .cse142 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse140 .cse141 .cse142 .cse137)))) .cse10) (= (let ((.cse144 (select v_arrayElimArr_32 .cse14))) (let ((.cse145 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse143 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse137 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse143 .cse144 .cse137 .cse145 (select (select (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse143 .cse144 .cse137 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse146 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse147 (select .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse151 (select .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse149 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse148 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse150 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse148 .cse149 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse148 .cse149 .cse150 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse148 .cse149 .cse150 .cse151))) .cse10) (= (let ((.cse153 (select v_arrayElimArr_32 .cse14))) (let ((.cse154 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse153 .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse152 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse153 .cse151 .cse154))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse152 .cse153 .cse151 .cse154 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse153 .cse151 .cse154))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse156 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse155 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse156 .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse155 .cse156 (select (select (store .cse146 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse156 .cse149 (- 3) .cse151))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse149 .cse151))) .cse17) (not (= .cse149 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse157 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse158 (select .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse162 (select .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse160 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse159 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse160 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse161 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse159 .cse160 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse159 .cse160 .cse161 .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse159 .cse160 .cse161 .cse162))) .cse10) (= (let ((.cse164 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse163 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse164 .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse163 .cse164 (select (select (store .cse157 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse158 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse163 .cse164 .cse160 (- 3) .cse162))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse160 .cse162))) .cse17) (not (= .cse160 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse35 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse169 (select v_arrayElimArr_32 .cse18))) (or (= (let ((.cse167 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse168 (select .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse170 (select .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse166 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse165 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse166 .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse165 .cse166 (select (select (store .cse167 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse168 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse165 .cse166 .cse169 (- 3) .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse169 .cse170)))))) .cse17) (not (= .cse169 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse19 (forall ((v_arrayElimArr_32 (Array Int Int))) (= (let ((.cse171 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse172 (select .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse174 (select v_arrayElimArr_32 .cse18)) (.cse176 (select .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse173 (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse174 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse175 (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse173 .cse174 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse171 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse173 .cse174 .cse175 .cse176))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse173 .cse174 .cse175 .cse176)))))) .cse10))) (or .cse19 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse177 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse178 (select .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse180 (select v_arrayElimArr_32 .cse18)) (.cse182 (select .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (let ((.cse179 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse180 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse181 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse179 .cse180 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse179 .cse180 .cse181 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse179 .cse180 .cse181 .cse182))) .cse10) (= (let ((.cse184 (select v_arrayElimArr_32 .cse14))) (let ((.cse185 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse184 .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse183 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse184 .cse182 .cse185))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse183 .cse184 .cse182 .cse185 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse183 .cse184 .cse182 .cse185))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse187 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse186 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse187 .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse186 .cse187 (select (select (store .cse177 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse178 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse186 .cse187 .cse180 (- 3) .cse182))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse180 .cse182))) .cse17))))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse188 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse189 (select .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse191 (select v_arrayElimArr_32 .cse18)) (.cse193 (select .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (let ((.cse190 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse191 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse192 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse190 .cse191 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse190 .cse191 .cse192 .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse190 .cse191 .cse192 .cse193))) .cse10) (= (let ((.cse195 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse194 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse195 .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse194 .cse195 (select (select (store .cse188 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse189 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse194 .cse195 .cse191 (- 3) .cse193))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse191 .cse193))) .cse17)))))) .cse19)) .cse42) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (= (select v_arrayElimArr_32 .cse18) 4) (= (let ((.cse200 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse201 (select .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse197 (select v_arrayElimArr_32 .cse14)) (.cse198 (select .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse199 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse197 .cse198))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse196 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse197 .cse198 .cse199))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse196 .cse197 .cse198 .cse199 (select (select (store .cse200 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse201 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse196 .cse197 .cse198 .cse199))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10))) .cse58) (or .cse35 (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse202 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse203 (select .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse207 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse205 (select .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse206 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse205 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse204 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse205 .cse206 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse204 .cse205 .cse206 .cse207))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse204 .cse205 .cse206 .cse207)))) (= .cse207 1) (= (let ((.cse209 (select v_arrayElimArr_32 .cse14))) (let ((.cse210 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse209 .cse205))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse208 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse209 .cse205 .cse210))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse208 .cse209 .cse205 .cse210 (select (select (store .cse202 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse203 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse208 .cse209 .cse205 .cse210))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (= (let ((.cse215 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse216 (select .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse212 (select v_arrayElimArr_32 .cse14)) (.cse213 (select .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse214 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse212 .cse213))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse211 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse212 .cse213 .cse214))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse211 .cse212 .cse213 .cse214 (select (select (store .cse215 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse216 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse211 .cse212 .cse213 .cse214))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10)) .cse58) (or (and (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse217 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse218 (select .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse222 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse220 (select .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse221 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse220 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse219 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse220 .cse221 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse219 .cse220 .cse221 .cse222))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse219 .cse220 .cse221 .cse222)))) (= .cse222 1) (= (let ((.cse224 (select v_arrayElimArr_32 .cse18))) (let ((.cse223 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse224 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse225 (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse223 .cse224 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse217 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse218 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse223 .cse224 .cse225 .cse220))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse223 .cse224 .cse225 .cse220)))) .cse10)))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse231 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse10 (let ((.cse226 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse227 (select .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse229 (select .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse230 (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse229 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse228 (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse229 .cse230 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse226 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse227 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse228 .cse229 .cse230 .cse231))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse228 .cse229 .cse230 .cse231))))))) (= .cse231 1))))) .cse42) (or .cse58 (forall ((v_arrayElimArr_32 (Array Int Int))) (or (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (let ((.cse236 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse237 (select .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse233 (select v_arrayElimArr_32 .cse14)) (.cse234 (select .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse235 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse233 .cse234))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse232 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse233 .cse234 .cse235))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse232 .cse233 .cse234 .cse235 (select (select (store .cse236 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse237 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse232 .cse233 .cse234 .cse235))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) .cse10)))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse238 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse239 (select .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse243 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse241 (select .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse10 (let ((.cse242 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse241 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse240 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse241 .cse242 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse240 .cse241 .cse242 .cse243))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse240 .cse241 .cse242 .cse243)))) (= .cse243 1) (= (let ((.cse245 (select v_arrayElimArr_32 .cse18))) (let ((.cse244 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse245 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse246 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse244 .cse245 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse244 .cse245 .cse246 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse244 .cse245 .cse246 .cse241)))) .cse10) (= (let ((.cse248 (select v_arrayElimArr_32 .cse14))) (let ((.cse249 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse248 .cse241))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse247 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse248 .cse241 .cse249))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse247 .cse248 .cse241 .cse249 (select (select (store .cse238 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse239 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse247 .cse248 .cse241 .cse249))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10)))))))) (or .cse58 (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse255 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse256 (select .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse250 (select v_arrayElimArr_32 .cse18)) (.cse253 (select .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse250 4) (= (let ((.cse252 (select v_arrayElimArr_32 .cse14))) (let ((.cse254 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse252 .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse251 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse252 .cse253 .cse254))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse251 .cse252 .cse253 .cse254 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse251 .cse252 .cse253 .cse254))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse258 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse257 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse258 .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse257 .cse258 (select (select (store .cse255 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse256 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse257 .cse258 .cse250 (- 3) .cse253))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse250 .cse253))) .cse17))))))) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse260 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_32))) (let ((.cse261 (select .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse264 (select .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse259 (select v_arrayElimArr_32 .cse18))) (or (= .cse259 4) (= (let ((.cse262 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse259 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse263 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse262 .cse259 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse262 .cse259 .cse263 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse262 .cse259 .cse263 .cse264))) .cse10) (= (let ((.cse266 (select v_arrayElimArr_32 .cse14))) (let ((.cse267 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse266 .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse265 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse266 .cse264 .cse267))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse265 .cse266 .cse264 .cse267 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse265 .cse266 .cse264 .cse267))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse10) (= (let ((.cse269 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse268 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse269 .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse268 .cse269 (select (select (store .cse260 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse261 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse268 .cse269 .cse259 (- 3) .cse264))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse259 .cse264))) .cse17) (not (= .cse259 (+ 3 (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse270))))) (or (not .cse0) (let ((.cse290 (select .cse298 .cse18))) (let ((.cse288 (select .cse298 .cse14)) (.cse287 (store .cse298 .cse299 (+ 3 .cse300))) (.cse289 (+ 3 .cse290))) (and (= .cse10 (let ((.cse286 (store (store .cse287 .cse14 (+ .cse288 3)) .cse18 .cse289))) (let ((.cse280 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse286))) (let ((.cse281 (select .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse282 (select .cse286 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse284 (select .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse283 (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse284))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse285 (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse283 .cse284))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ (select (select (store .cse280 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse281 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse282 .cse283 .cse284 .cse285))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse282 .cse283 .cse284 .cse285)))))))) (or (= .cse290 1) .cse270) (or (= .cse288 1) (forall ((v_ArrVal_601 Int)) (= (let ((.cse297 (store (store .cse287 .cse14 v_ArrVal_601) .cse18 .cse289))) (let ((.cse295 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse297))) (let ((.cse296 (select .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse293 (select .cse297 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse294 (select .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse292 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse291 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse292 .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse291 .cse292 .cse293 .cse294 (select (select (store .cse295 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse296 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse291 .cse292 .cse293 .cse294))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))) .cse10)))))))))))) is different from true [2022-11-03 02:12:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 02:16:09,953 WARN L234 SmtUtils]: Spent 3.14m on a formula simplification. DAG size of input: 84 DAG size of output: 62 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:16:09,954 INFO L356 Elim1Store]: treesize reduction 173, result has 45.4 percent of original size [2022-11-03 02:16:09,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 100302 treesize of output 20246 [2022-11-03 02:18:22,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2022-11-03 02:20:41,377 WARN L234 SmtUtils]: Spent 2.32m on a formula simplification that was a NOOP. DAG size: 164 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:20:41,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:20:41,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 11 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 14 new quantified variables, introduced 66 case distinctions, treesize of input 7178 treesize of output 16531 [2022-11-03 02:21:54,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2022-11-03 02:22:05,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34