./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/condg.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur --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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- 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-38b53e6 [2022-11-25 23:39:50,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:39:50,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:39:50,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:39:50,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:39:50,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:39:50,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:39:50,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:39:50,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:39:50,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:39:50,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:39:50,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:39:50,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:39:50,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:39:50,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:39:50,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:39:50,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:39:50,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:39:50,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:39:50,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:39:50,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:39:50,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:39:50,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:39:50,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:39:50,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:39:50,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:39:50,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:39:50,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:39:50,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:39:50,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:39:50,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:39:50,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:39:50,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:39:50,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:39:50,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:39:50,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:39:50,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:39:50,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:39:50,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:39:50,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:39:50,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:39:50,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:39:50,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:39:50,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:39:50,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:39:50,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:39:50,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:39:50,873 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:39:50,874 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:39:50,874 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:39:50,874 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:39:50,874 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:39:50,876 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:39:50,876 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:39:50,876 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:39:50,877 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:39:50,877 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:39:50,877 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:39:50,878 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:39:50,878 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:39:50,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:39:50,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:39:50,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:39:50,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:39:50,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:39:50,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:39:50,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:39:50,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:39:50,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:39:50,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:39:50,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:39:50,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:39:50,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:39:50,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:39:50,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:39:50,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:39:50,884 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:39:50,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:39:50,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:39:50,885 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:39:50,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:39:50,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:39:50,885 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:39:50,887 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_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/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_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur 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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-11-25 23:39:51,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:39:51,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:39:51,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:39:51,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:39:51,285 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:39:51,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-fpi/condg.c [2022-11-25 23:39:55,016 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:39:55,276 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:39:55,276 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/sv-benchmarks/c/array-fpi/condg.c [2022-11-25 23:39:55,284 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/data/6c8cb1f11/d03a7b69fc094ba79078e51beb949e44/FLAGeaef416df [2022-11-25 23:39:55,303 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/data/6c8cb1f11/d03a7b69fc094ba79078e51beb949e44 [2022-11-25 23:39:55,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:39:55,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:39:55,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:39:55,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:39:55,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:39:55,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d456324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55, skipping insertion in model container [2022-11-25 23:39:55,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:39:55,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:39:55,564 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-11-25 23:39:55,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:39:55,621 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:39:55,636 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-11-25 23:39:55,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:39:55,664 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:39:55,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55 WrapperNode [2022-11-25 23:39:55,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:39:55,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:39:55,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:39:55,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:39:55,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,711 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2022-11-25 23:39:55,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:39:55,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:39:55,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:39:55,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:39:55,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:39:55,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:39:55,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:39:55,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:39:55,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (1/1) ... [2022-11-25 23:39:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:39:55,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:55,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:39:55,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:39:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:39:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:39:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:39:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:39:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:39:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:39:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:39:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:39:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:39:55,932 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:39:55,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:39:56,161 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:39:56,231 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:39:56,232 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 23:39:56,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:39:56 BoogieIcfgContainer [2022-11-25 23:39:56,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:39:56,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:39:56,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:39:56,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:39:56,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:39:55" (1/3) ... [2022-11-25 23:39:56,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de3a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:39:56, skipping insertion in model container [2022-11-25 23:39:56,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:39:55" (2/3) ... [2022-11-25 23:39:56,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de3a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:39:56, skipping insertion in model container [2022-11-25 23:39:56,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:39:56" (3/3) ... [2022-11-25 23:39:56,248 INFO L112 eAbstractionObserver]: Analyzing ICFG condg.c [2022-11-25 23:39:56,273 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:39:56,273 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:39:56,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:39:56,370 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;@e90efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:39:56,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:39:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-25 23:39:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:39:56,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:56,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:56,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1910084069, now seen corresponding path program 1 times [2022-11-25 23:39:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:56,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089469000] [2022-11-25 23:39:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:56,877 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-25 23:39:56,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:56,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089469000] [2022-11-25 23:39:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089469000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:56,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:56,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:39:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168267550] [2022-11-25 23:39:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:56,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:39:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:39:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:39:56,927 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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.6666666666666665) internal successors, (8), 3 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-25 23:39:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:56,997 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-11-25 23:39:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:39:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-25 23:39:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:57,010 INFO L225 Difference]: With dead ends: 22 [2022-11-25 23:39:57,010 INFO L226 Difference]: Without dead ends: 11 [2022-11-25 23:39:57,013 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-25 23:39:57,018 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:57,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:39:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-25 23:39:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-25 23:39:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-25 23:39:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-11-25 23:39:57,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2022-11-25 23:39:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:57,059 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-11-25 23:39:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-25 23:39:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-11-25 23:39:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:39:57,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:57,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:57,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:39:57,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:57,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1202687252, now seen corresponding path program 1 times [2022-11-25 23:39:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:57,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218039652] [2022-11-25 23:39:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:57,276 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-25 23:39:57,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:57,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218039652] [2022-11-25 23:39:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218039652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:57,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:57,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:39:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659508248] [2022-11-25 23:39:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:39:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:39:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:39:57,288 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-25 23:39:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:57,368 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-11-25 23:39:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:39:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 23:39:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:57,370 INFO L225 Difference]: With dead ends: 24 [2022-11-25 23:39:57,373 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 23:39:57,374 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-25 23:39:57,376 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:57,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:39:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 23:39:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-11-25 23:39:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-25 23:39:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-11-25 23:39:57,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2022-11-25 23:39:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-25 23:39:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-25 23:39:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-11-25 23:39:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:39:57,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:57,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:57,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:39:57,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 867584416, now seen corresponding path program 1 times [2022-11-25 23:39:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:57,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668219045] [2022-11-25 23:39:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:58,898 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-25 23:39:58,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668219045] [2022-11-25 23:39:58,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668219045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:58,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035471328] [2022-11-25 23:39:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:58,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:58,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:58,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:58,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:39:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:59,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 23:39:59,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:59,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:59,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:59,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:39:59,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:59,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 23:39:59,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:59,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 74 [2022-11-25 23:39:59,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-25 23:39:59,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:59,971 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 25 [2022-11-25 23:39:59,999 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-25 23:39:59,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:00,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:40:00,482 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-25 23:40:00,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035471328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:00,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403781664] [2022-11-25 23:40:00,512 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:00,512 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:00,531 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:00,538 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:00,539 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:00,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,728 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:00,729 INFO L350 Elim1Store]: Elim1 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-25 23:40:00,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:00,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,821 INFO L350 Elim1Store]: Elim1 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-25 23:40:00,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:00,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 23:40:01,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:01,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:01,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:01,331 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-25 23:40:01,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 443 treesize of output 437 [2022-11-25 23:40:01,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:01,657 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:01,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:40:01,775 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:01,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:01,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:01,871 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:01,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:40:01,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:01,908 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:40:01,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-25 23:40:02,001 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:02,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:02,055 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:02,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:02,083 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:02,781 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '209#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:02,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:02,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:02,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-25 23:40:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062342056] [2022-11-25 23:40:02,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:02,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 23:40:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 23:40:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:40:02,786 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-25 23:40:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:03,419 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-11-25 23:40:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:40:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-25 23:40:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:03,421 INFO L225 Difference]: With dead ends: 31 [2022-11-25 23:40:03,421 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 23:40:03,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:40:03,423 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:03,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:40:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 23:40:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2022-11-25 23:40:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-25 23:40:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-11-25 23:40:03,438 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 11 [2022-11-25 23:40:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:03,441 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-11-25 23:40:03,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-25 23:40:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-11-25 23:40:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:40:03,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:03,444 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:03,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:03,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:03,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1750679399, now seen corresponding path program 2 times [2022-11-25 23:40:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:03,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205837937] [2022-11-25 23:40:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:03,799 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-25 23:40:03,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205837937] [2022-11-25 23:40:03,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205837937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426718736] [2022-11-25 23:40:03,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:40:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:03,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:03,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:40:03,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:40:03,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:03,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:40:03,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:03,954 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-25 23:40:03,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:03,992 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-25 23:40:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426718736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:03,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12785250] [2022-11-25 23:40:03,998 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:03,998 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:03,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:03,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:04,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:04,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,155 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:04,156 INFO L350 Elim1Store]: Elim1 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-25 23:40:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:04,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,220 INFO L350 Elim1Store]: Elim1 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-25 23:40:04,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:40:04,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:04,594 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:40:04,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:40:04,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:04,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:04,845 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:40:04,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:40:04,943 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:04,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:05,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:05,058 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:05,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 23:40:05,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:05,104 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:05,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:40:05,211 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:05,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:05,261 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:05,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:05,326 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:05,949 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '387#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:05,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:05,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:05,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-25 23:40:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722135215] [2022-11-25 23:40:05,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:05,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:40:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:40:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:40:05,955 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-25 23:40:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:06,093 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-25 23:40:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:40:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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) Word has length 12 [2022-11-25 23:40:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:06,098 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:40:06,099 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 23:40:06,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:40:06,103 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:06,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:40:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 23:40:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2022-11-25 23:40:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-25 23:40:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-25 23:40:06,120 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-11-25 23:40:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:06,121 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-25 23:40:06,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-25 23:40:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-25 23:40:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:40:06,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:06,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:06,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 23:40:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:06,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2081436655, now seen corresponding path program 3 times [2022-11-25 23:40:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:06,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993486624] [2022-11-25 23:40:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:06,488 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-25 23:40:06,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:06,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993486624] [2022-11-25 23:40:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993486624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606306034] [2022-11-25 23:40:06,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:40:06,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:06,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:06,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:40:06,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:40:06,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:06,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:40:06,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:06,668 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-25 23:40:06,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:06,723 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-25 23:40:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606306034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [197987187] [2022-11-25 23:40:06,728 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:06,729 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:06,729 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:06,730 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:06,730 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:06,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,874 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:06,875 INFO L350 Elim1Store]: Elim1 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-25 23:40:06,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:06,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,937 INFO L350 Elim1Store]: Elim1 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-25 23:40:06,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:06,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 23:40:07,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:07,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:07,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:07,249 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-25 23:40:07,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 443 treesize of output 437 [2022-11-25 23:40:07,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:07,573 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:07,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:40:07,652 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:07,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:07,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:07,750 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:40:07,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:07,785 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:40:07,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-11-25 23:40:07,881 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:07,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:07,931 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:07,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:07,984 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:08,627 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '582#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:08,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:08,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:08,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 23:40:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386706011] [2022-11-25 23:40:08,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:08,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:40:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:08,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:40:08,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:40:08,630 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-25 23:40:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:08,801 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-25 23:40:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:40:08,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) Word has length 12 [2022-11-25 23:40:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:08,802 INFO L225 Difference]: With dead ends: 32 [2022-11-25 23:40:08,803 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 23:40:08,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:40:08,804 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:08,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 18 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:40:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 23:40:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2022-11-25 23:40:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-25 23:40:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-25 23:40:08,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2022-11-25 23:40:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:08,810 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-25 23:40:08,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-25 23:40:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-11-25 23:40:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:40:08,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:08,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:08,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:40:09,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:09,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -900606331, now seen corresponding path program 4 times [2022-11-25 23:40:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:09,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540366885] [2022-11-25 23:40:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:11,290 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-25 23:40:11,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540366885] [2022-11-25 23:40:11,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540366885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86029407] [2022-11-25 23:40:11,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:40:11,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:11,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:11,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:11,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:40:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:11,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 23:40:11,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:11,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:40:11,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:40:11,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-25 23:40:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:11,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-25 23:40:11,638 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 33 [2022-11-25 23:40:11,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:11,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:11,715 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 35 [2022-11-25 23:40:11,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 85 [2022-11-25 23:40:11,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:11,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2022-11-25 23:40:12,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:12,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:12,106 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-25 23:40:12,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 122 [2022-11-25 23:40:12,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-11-25 23:40:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:12,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-11-25 23:40:12,304 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-25 23:40:12,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:12,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 23:40:13,687 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-25 23:40:13,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86029407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567813471] [2022-11-25 23:40:13,690 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:13,691 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:13,691 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:13,691 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:13,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:13,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,810 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:13,810 INFO L350 Elim1Store]: Elim1 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-25 23:40:13,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,832 INFO L350 Elim1Store]: Elim1 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-25 23:40:13,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:13,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:13,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:40:14,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:14,170 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:40:14,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:40:14,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:14,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:14,349 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:14,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:40:14,439 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:14,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:14,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:14,519 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:14,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:40:14,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:14,550 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:40:14,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-25 23:40:14,632 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:14,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:14,681 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:14,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:14,706 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:15,407 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '777#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:15,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:15,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:15,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-11-25 23:40:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318059111] [2022-11-25 23:40:15,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:40:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:40:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 23:40:15,411 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-25 23:40:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:18,112 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-11-25 23:40:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:40:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-25 23:40:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:18,113 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:40:18,113 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 23:40:18,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 23:40:18,115 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:18,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 80 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:40:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 23:40:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-11-25 23:40:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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-25 23:40:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-25 23:40:18,127 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 14 [2022-11-25 23:40:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:18,127 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-25 23:40:18,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-25 23:40:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-25 23:40:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:40:18,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:18,129 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:18,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:18,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:40:18,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1631292812, now seen corresponding path program 5 times [2022-11-25 23:40:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:18,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226188174] [2022-11-25 23:40:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:18,484 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-25 23:40:18,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:18,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226188174] [2022-11-25 23:40:18,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226188174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:18,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318337649] [2022-11-25 23:40:18,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:40:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:18,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:18,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:40:18,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:40:18,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:18,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:40:18,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:18,718 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-25 23:40:18,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:18,791 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-25 23:40:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318337649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907845068] [2022-11-25 23:40:18,796 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:18,796 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:18,797 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:18,797 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:18,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:18,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,917 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:18,918 INFO L350 Elim1Store]: Elim1 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-25 23:40:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,946 INFO L350 Elim1Store]: Elim1 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-25 23:40:18,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:18,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:40:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:19,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:19,285 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:40:19,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:40:19,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:19,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:19,482 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:40:19,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:40:19,573 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:19,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:19,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:19,661 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:19,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2022-11-25 23:40:19,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:19,704 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:19,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:40:19,812 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:19,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:19,859 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:19,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:19,945 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:20,539 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1033#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:20,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:20,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:20,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 23:40:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698703406] [2022-11-25 23:40:20,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:40:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:40:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:40:20,542 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-25 23:40:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:20,908 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-11-25 23:40:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:40:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Word has length 15 [2022-11-25 23:40:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:20,910 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:40:20,910 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 23:40:20,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:40:20,912 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:20,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 85 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:40:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 23:40:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2022-11-25 23:40:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-25 23:40:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-25 23:40:20,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2022-11-25 23:40:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:20,937 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-25 23:40:20,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-25 23:40:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-25 23:40:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:40:20,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:20,939 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:20,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:21,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:21,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1222709546, now seen corresponding path program 6 times [2022-11-25 23:40:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:21,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554410593] [2022-11-25 23:40:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:21,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:40:21,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554410593] [2022-11-25 23:40:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554410593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441629006] [2022-11-25 23:40:21,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:40:21,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:21,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:21,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:21,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:40:21,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:40:21,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:21,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:40:21,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:40:21,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:40:21,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441629006] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825759047] [2022-11-25 23:40:21,622 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:21,622 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:21,623 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:21,623 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:21,623 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:21,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,734 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-25 23:40:21,734 INFO L350 Elim1Store]: Elim1 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 57 [2022-11-25 23:40:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,776 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:40:21,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-25 23:40:21,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,899 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:21,899 INFO L350 Elim1Store]: Elim1 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-25 23:40:21,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:21,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 23:40:22,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:22,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:22,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:22,187 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-25 23:40:22,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 443 treesize of output 437 [2022-11-25 23:40:22,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:22,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:22,492 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:40:22,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:40:22,574 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:22,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:22,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:22,673 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:22,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2022-11-25 23:40:22,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:22,721 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:22,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:40:22,828 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:22,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:22,874 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:22,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:22,924 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:23,695 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1306#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:23,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:23,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:23,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2022-11-25 23:40:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722895977] [2022-11-25 23:40:23,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:23,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:40:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:40:23,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:40:23,699 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-25 23:40:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:23,880 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-25 23:40:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:40:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-25 23:40:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:23,882 INFO L225 Difference]: With dead ends: 59 [2022-11-25 23:40:23,882 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:40:23,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:40:23,883 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:23,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 39 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:40:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:40:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-11-25 23:40:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-25 23:40:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-25 23:40:23,895 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-11-25 23:40:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:23,896 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-25 23:40:23,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-25 23:40:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-25 23:40:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:40:23,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:23,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:23,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:24,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:24,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash 702654167, now seen corresponding path program 1 times [2022-11-25 23:40:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:24,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028221000] [2022-11-25 23:40:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:40:26,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028221000] [2022-11-25 23:40:26,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028221000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343400631] [2022-11-25 23:40:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:26,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:26,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:40:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:26,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 23:40:26,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:26,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:26,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:40:26,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-25 23:40:26,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:40:26,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 85 [2022-11-25 23:40:26,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:40:26,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-11-25 23:40:26,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 23:40:26,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 94 [2022-11-25 23:40:26,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2022-11-25 23:40:26,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:26,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-25 23:40:26,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 23:40:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:40:27,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:28,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:40:28,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 23:40:28,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:40:28,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 23:40:28,544 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_11 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) 0))) (forall ((v_arrayElimArr_12 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1))) is different from false [2022-11-25 23:40:28,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:40:28,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-11-25 23:40:28,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:40:28,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 55 [2022-11-25 23:40:28,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-25 23:40:28,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:40:28,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 23:40:28,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:28,802 INFO L321 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2022-11-25 23:40:28,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 17 [2022-11-25 23:40:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 23:40:28,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343400631] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:28,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156455737] [2022-11-25 23:40:28,860 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:40:28,861 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:28,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:28,861 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:28,861 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:28,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:28,938 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:40:28,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-25 23:40:28,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:28,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:28,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,073 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:29,074 INFO L350 Elim1Store]: Elim1 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-25 23:40:29,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,099 INFO L350 Elim1Store]: Elim1 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-25 23:40:29,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:40:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:29,380 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:40:29,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:40:29,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:29,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:29,558 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:29,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:40:29,647 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:29,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:29,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:29,733 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:29,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:40:29,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:29,765 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:40:29,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-25 23:40:29,851 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:29,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:29,898 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:40:29,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:40:30,047 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:31,175 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1588#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |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_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |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))' at error location [2022-11-25 23:40:31,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:31,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:31,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 37 [2022-11-25 23:40:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236055749] [2022-11-25 23:40:31,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:31,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 23:40:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:31,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 23:40:31,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1539, Unknown=4, NotChecked=80, Total=1806 [2022-11-25 23:40:31,179 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-25 23:40:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:34,918 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-11-25 23:40:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 23:40:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-25 23:40:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:34,919 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:40:34,919 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:40:34,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=472, Invalid=4084, Unknown=4, NotChecked=132, Total=4692 [2022-11-25 23:40:34,922 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:34,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 333 Invalid, 0 Unknown, 26 Unchecked, 0.7s Time] [2022-11-25 23:40:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:40:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-11-25 23:40:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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-25 23:40:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-25 23:40:34,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-11-25 23:40:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:34,942 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-25 23:40:34,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-25 23:40:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-25 23:40:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:40:34,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:34,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:34,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:35,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:35,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1191869440, now seen corresponding path program 7 times [2022-11-25 23:40:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:35,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528982186] [2022-11-25 23:40:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:37,872 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-25 23:40:37,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528982186] [2022-11-25 23:40:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528982186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:40:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332732736] [2022-11-25 23:40:37,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:40:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:37,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:37,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:40:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:40:38,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-25 23:40:38,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:38,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:40:38,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:40:38,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:40:38,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:40:38,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,253 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 42 [2022-11-25 23:40:38,414 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 43 [2022-11-25 23:40:38,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2022-11-25 23:40:38,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:38,589 INFO L350 Elim1Store]: Elim1 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 59 [2022-11-25 23:40:38,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2022-11-25 23:40:38,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:38,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-11-25 23:40:39,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 104 [2022-11-25 23:40:39,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:39,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:39,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:39,108 INFO L321 Elim1Store]: treesize reduction 43, result has 49.4 percent of original size [2022-11-25 23:40:39,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 59 treesize of output 87 [2022-11-25 23:40:39,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:39,513 INFO L321 Elim1Store]: treesize reduction 146, result has 43.2 percent of original size [2022-11-25 23:40:39,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 219 [2022-11-25 23:40:39,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2022-11-25 23:40:39,635 INFO L321 Elim1Store]: treesize reduction 21, result has 40.0 percent of original size [2022-11-25 23:40:39,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:40:40,010 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-25 23:40:40,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:40,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 23:40:40,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-11-25 23:40:42,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_236| Int)) (or (forall ((v_ArrVal_455 Int) (v_ArrVal_454 Int)) (= (select (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_main_~i~0#1_236| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_455) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_237| 1) |v_ULTIMATE.start_main_~i~0#1_236|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_237|)))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) is different from false [2022-11-25 23:40:44,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)))) (let ((.cse0 (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_237|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_236| Int)) (or (forall ((v_ArrVal_455 Int) (v_ArrVal_454 Int)) (= (select (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_main_~i~0#1_236| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_455) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_237| 1) |v_ULTIMATE.start_main_~i~0#1_236|)))))) (= c_~N~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= .cse2 c_~N~0)))))) is different from false [2022-11-25 23:40:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:40:51,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332732736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:51,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1841479729] [2022-11-25 23:40:51,352 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:40:51,353 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:51,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:51,353 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:51,354 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:51,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,477 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:40:51,478 INFO L350 Elim1Store]: Elim1 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-25 23:40:51,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,503 INFO L350 Elim1Store]: Elim1 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-25 23:40:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:40:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:40:51,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:40:51,846 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:40:51,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:40:51,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:40:52,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:52,044 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:40:52,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:40:52,144 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:40:52,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:40:52,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:52,250 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:40:52,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:40:52,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:40:52,284 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:40:52,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-11-25 23:40:52,380 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:52,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 57 [2022-11-25 23:40:52,442 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:40:52,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:40:52,505 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:53,551 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1910#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:40:53,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:53,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:40:53,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-11-25 23:40:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426276799] [2022-11-25 23:40:53,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:53,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 23:40:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 23:40:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1708, Unknown=3, NotChecked=170, Total=2070 [2022-11-25 23:40:53,556 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-25 23:41:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:18,855 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-11-25 23:41:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 23:41:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-25 23:41:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:18,856 INFO L225 Difference]: With dead ends: 74 [2022-11-25 23:41:18,856 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:41:18,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=427, Invalid=3738, Unknown=3, NotChecked=254, Total=4422 [2022-11-25 23:41:18,859 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:18,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 121 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 465 Invalid, 0 Unknown, 79 Unchecked, 3.2s Time] [2022-11-25 23:41:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:41:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-11-25 23:41:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 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-25 23:41:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-11-25 23:41:18,883 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2022-11-25 23:41:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:18,883 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-11-25 23:41:18,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-25 23:41:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-11-25 23:41:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:41:18,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:18,884 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:18,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:19,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:41:19,085 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 205170097, now seen corresponding path program 8 times [2022-11-25 23:41:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:19,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187942298] [2022-11-25 23:41:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:19,248 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-25 23:41:19,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187942298] [2022-11-25 23:41:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187942298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:41:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979310141] [2022-11-25 23:41:19,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:41:19,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:19,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:19,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:41:19,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:41:19,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:41:19,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:41:19,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:19,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-25 23:41:19,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:19,554 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-25 23:41:19,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979310141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:19,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [912270668] [2022-11-25 23:41:19,556 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:41:19,556 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:19,556 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:19,556 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:19,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:19,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,650 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-25 23:41:19,650 INFO L350 Elim1Store]: Elim1 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 57 [2022-11-25 23:41:19,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,684 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:41:19,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-25 23:41:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,787 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:41:19,787 INFO L350 Elim1Store]: Elim1 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-25 23:41:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:41:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:19,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:19,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:20,017 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:41:20,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:41:20,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:41:20,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:20,171 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:20,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:41:20,267 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:41:20,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:41:20,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:20,335 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:20,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:41:20,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:20,364 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:41:20,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-25 23:41:20,430 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:41:20,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:41:20,470 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:41:20,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:41:20,487 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:20,867 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2279#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:41:20,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:20,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:41:20,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-25 23:41:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497236575] [2022-11-25 23:41:20,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:20,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:41:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:41:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:41:20,869 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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-25 23:41:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:21,221 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2022-11-25 23:41:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:41:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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 18 [2022-11-25 23:41:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:21,222 INFO L225 Difference]: With dead ends: 97 [2022-11-25 23:41:21,222 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 23:41:21,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:41:21,223 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:21,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 129 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:41:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 23:41:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2022-11-25 23:41:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 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-25 23:41:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-25 23:41:21,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 18 [2022-11-25 23:41:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:21,249 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-25 23:41:21,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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-25 23:41:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-25 23:41:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:41:21,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:21,251 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:21,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:21,456 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1567448571, now seen corresponding path program 9 times [2022-11-25 23:41:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:21,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226602826] [2022-11-25 23:41:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 23:41:21,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:21,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226602826] [2022-11-25 23:41:21,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226602826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:41:21,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567235562] [2022-11-25 23:41:21,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:41:21,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:21,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:21,614 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:21,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:41:21,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:41:21,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:41:21,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:41:21,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:41:21,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:41:22,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567235562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:22,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945472207] [2022-11-25 23:41:22,061 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:41:22,062 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:22,062 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:22,062 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:22,062 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:22,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,113 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:41:22,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-25 23:41:22,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,215 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-25 23:41:22,215 INFO L350 Elim1Store]: Elim1 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 57 [2022-11-25 23:41:22,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,326 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:41:22,327 INFO L350 Elim1Store]: Elim1 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-25 23:41:22,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:41:22,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:22,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:22,608 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:41:22,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:41:22,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:41:22,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:22,811 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:22,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:41:22,892 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:41:22,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:41:22,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:22,969 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:22,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:41:22,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:23,003 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:41:23,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-11-25 23:41:23,097 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:41:23,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:41:23,144 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:41:23,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:41:23,191 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:23,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2675#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:41:23,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:23,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:41:23,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 27 [2022-11-25 23:41:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399369398] [2022-11-25 23:41:23,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:23,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:41:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:41:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:41:23,749 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-25 23:41:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:24,550 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-11-25 23:41:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 23:41:24,551 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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 20 [2022-11-25 23:41:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:24,552 INFO L225 Difference]: With dead ends: 124 [2022-11-25 23:41:24,552 INFO L226 Difference]: Without dead ends: 97 [2022-11-25 23:41:24,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=386, Invalid=2266, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 23:41:24,554 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 181 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:24,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 215 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:41:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-25 23:41:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-11-25 23:41:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-25 23:41:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-11-25 23:41:24,583 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 20 [2022-11-25 23:41:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:24,584 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-11-25 23:41:24,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-25 23:41:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-11-25 23:41:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:41:24,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:24,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:24,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:24,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:41:24,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash -103922907, now seen corresponding path program 10 times [2022-11-25 23:41:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:24,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775592540] [2022-11-25 23:41:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:27,560 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-25 23:41:27,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775592540] [2022-11-25 23:41:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775592540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:41:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357069384] [2022-11-25 23:41:27,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:41:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:27,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:27,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:41:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 23:41:27,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:27,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:41:27,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:41:27,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-25 23:41:27,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:41:27,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,893 INFO L350 Elim1Store]: Elim1 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-25 23:41:27,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:27,970 INFO L350 Elim1Store]: Elim1 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-25 23:41:28,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-11-25 23:41:28,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,176 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 61 [2022-11-25 23:41:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2022-11-25 23:41:28,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-11-25 23:41:28,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,653 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 159 [2022-11-25 23:41:28,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 109 [2022-11-25 23:41:28,685 INFO L350 Elim1Store]: Elim1 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 85 treesize of output 45 [2022-11-25 23:41:28,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 147 [2022-11-25 23:41:28,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:28,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:28,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 131 [2022-11-25 23:41:29,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:29,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:29,003 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 36 [2022-11-25 23:41:29,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:29,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:29,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:29,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2022-11-25 23:41:29,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:29,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:41:29,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2022-11-25 23:41:29,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 23:41:29,366 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-25 23:41:29,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:33,252 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-25 23:41:33,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357069384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163317723] [2022-11-25 23:41:33,254 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:41:33,254 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:33,254 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:33,254 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:33,255 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:33,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,357 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:41:33,357 INFO L350 Elim1Store]: Elim1 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-25 23:41:33,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:41:33,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,400 INFO L350 Elim1Store]: Elim1 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-25 23:41:33,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 23:41:33,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:33,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:33,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:33,642 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-25 23:41:33,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 443 treesize of output 437 [2022-11-25 23:41:33,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:41:33,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:33,804 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:41:33,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:41:33,895 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:41:33,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:41:33,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:33,974 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:33,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2022-11-25 23:41:33,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:34,004 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:41:34,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:41:34,094 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:41:34,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:41:34,135 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:41:34,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:41:34,181 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:36,006 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3180#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:41:36,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:36,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:41:36,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2022-11-25 23:41:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078600523] [2022-11-25 23:41:36,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 23:41:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 23:41:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2741, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 23:41:36,009 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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-25 23:41:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:44,321 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-11-25 23:41:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 23:41:44,321 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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 20 [2022-11-25 23:41:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:44,322 INFO L225 Difference]: With dead ends: 98 [2022-11-25 23:41:44,322 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 23:41:44,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=489, Invalid=5061, Unknown=0, NotChecked=0, Total=5550 [2022-11-25 23:41:44,325 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:44,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 168 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-25 23:41:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 23:41:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2022-11-25 23:41:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 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-25 23:41:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-25 23:41:44,360 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 20 [2022-11-25 23:41:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:44,360 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-25 23:41:44,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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-25 23:41:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-25 23:41:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:41:44,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:44,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:44,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:41:44,567 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1406371200, now seen corresponding path program 2 times [2022-11-25 23:41:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:44,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932065132] [2022-11-25 23:41:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:41:46,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932065132] [2022-11-25 23:41:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932065132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:41:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480224373] [2022-11-25 23:41:46,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:41:46,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:46,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:46,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:46,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:41:46,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:41:46,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:41:46,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-25 23:41:46,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:46,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:41:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:46,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:41:46,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:46,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 23:41:47,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:41:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:41:47,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,231 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 42 [2022-11-25 23:41:47,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:41:47,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2022-11-25 23:41:47,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-11-25 23:41:47,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-25 23:41:47,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-25 23:41:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 89 [2022-11-25 23:41:47,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-25 23:41:47,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:41:47,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:41:47,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:47,737 INFO L321 Elim1Store]: treesize reduction 72, result has 52.9 percent of original size [2022-11-25 23:41:47,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 166 [2022-11-25 23:41:48,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:41:48,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 168 [2022-11-25 23:41:48,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:41:48,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2022-11-25 23:41:48,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:41:48,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2022-11-25 23:41:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:41:50,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:22,416 WARN L233 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 98 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:42:22,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:22,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 185 [2022-11-25 23:42:22,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:22,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 153 [2022-11-25 23:42:22,533 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_794 Int) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_1 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse2 (let ((.cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse5 (+ (- 1) (select .cse1 .cse5)))))) (or (not (< v_subst_1 c_~N~0)) (not (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (= (select .cse2 .cse3) 0) (< (+ v_subst_1 1) c_~N~0) (not (= (select .cse2 .cse4) 0))))))) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse10 .cse4) 1))))) (let ((.cse6 (let ((.cse9 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))))) (or (< (+ v_subst_2 1) c_~N~0) (= (select .cse6 .cse3) 0) (not (= (select .cse6 .cse4) 0)) (not (< v_subst_2 c_~N~0)) (= c_~N~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))))) (not (< 2 c_~N~0))) is different from false [2022-11-25 23:42:35,381 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:42:40,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:40,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 219 [2022-11-25 23:42:40,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 339 [2022-11-25 23:42:40,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:40,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 305 treesize of output 358 [2022-11-25 23:42:40,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:40,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 296 treesize of output 310 [2022-11-25 23:42:42,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:42,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 629 treesize of output 275 [2022-11-25 23:42:42,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 570 [2022-11-25 23:42:42,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:42,355 INFO L321 Elim1Store]: treesize reduction 84, result has 35.9 percent of original size [2022-11-25 23:42:42,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1368 treesize of output 1346 [2022-11-25 23:42:42,506 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-25 23:42:42,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1822 treesize of output 1786 [2022-11-25 23:42:43,188 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-25 23:42:43,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 1 [2022-11-25 23:42:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-25 23:42:43,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480224373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:43,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1836164398] [2022-11-25 23:42:43,336 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:42:43,336 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:43,336 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:43,337 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:43,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:43,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,444 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-25 23:42:43,447 INFO L350 Elim1Store]: Elim1 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 57 [2022-11-25 23:42:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,489 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:42:43,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 112 [2022-11-25 23:42:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,608 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:42:43,609 INFO L350 Elim1Store]: Elim1 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-25 23:42:43,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 23:42:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:43,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:43,901 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-25 23:42:43,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 34 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 443 treesize of output 437 [2022-11-25 23:42:43,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:42:44,035 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:42:44,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:42:44,114 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:42:44,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:42:44,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:44,184 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:42:44,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 23:42:44,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:44,217 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:42:44,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-11-25 23:42:44,308 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:42:44,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:42:44,355 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:42:44,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:42:44,433 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:47,364 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3664#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |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_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |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))' at error location [2022-11-25 23:42:47,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:47,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 19] total 51 [2022-11-25 23:42:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814935096] [2022-11-25 23:42:47,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:47,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 23:42:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 23:42:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2645, Unknown=14, NotChecked=106, Total=3080 [2022-11-25 23:42:47,367 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 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-25 23:43:32,282 WARN L233 SmtUtils]: Spent 25.87s on a formula simplification. DAG size of input: 245 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:35,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:43:37,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:13,334 WARN L233 SmtUtils]: Spent 31.55s on a formula simplification. DAG size of input: 230 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:15,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:17,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:19,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:21,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:55,477 WARN L233 SmtUtils]: Spent 29.72s on a formula simplification. DAG size of input: 199 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:57,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:44:59,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:45:02,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:45:02,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse50 (store .cse49 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse27 (< |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse22 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse50 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (.cse13 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50)) (.cse11 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse12 (not (< 2 c_~N~0))) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (and (forall ((v_ArrVal_794 Int) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_1 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse2 (let ((.cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse5 (+ (- 1) (select .cse1 .cse5)))))) (or (not (< v_subst_1 c_~N~0)) (not (= c_~N~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (= (select .cse2 .cse3) 0) (< (+ v_subst_1 1) c_~N~0) (not (= (select .cse2 .cse4) 0))))))) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse10 .cse4) 1))))) (let ((.cse6 (let ((.cse9 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))))) (or (< (+ v_subst_2 1) c_~N~0) (= (select .cse6 .cse3) 0) (not (= (select .cse6 .cse4) 0)) (not (< v_subst_2 c_~N~0)) (= c_~N~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) .cse11 .cse12) (or .cse13 (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse15 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse16 (let ((.cse19 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse19 .cse4) 1))))) (let ((.cse14 (let ((.cse18 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse16 .cse18 (+ (select .cse16 .cse18) 1))))) (or (= (select .cse14 .cse3) 0) (< v_subst_2 |c_ULTIMATE.start_main_~i~0#1|) (not (= (select .cse14 .cse4) 0)) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (< (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) .cse17))))))) (forall ((v_ArrVal_794 Int) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_1 Int)) (let ((.cse24 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse25 (store (store (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse21 (let ((.cse26 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse25 .cse26 (+ (- 1) (select .cse25 .cse26))))) (.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (select .cse21 .cse4) 0)) (< .cse22 .cse23) (= (select .cse21 .cse3) 0) (< (+ v_subst_1 1) .cse23) (not (< v_subst_1 .cse23)) (not (< 2 .cse23)) (not (< |c_ULTIMATE.start_main_~i~0#1| .cse23))))))) (or .cse27 (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse29 (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse30 (let ((.cse32 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse32 .cse4) 1))))) (let ((.cse28 (let ((.cse31 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse30 .cse31 (+ (select .cse30 .cse31) 1))))) (or (not (= (select .cse28 .cse4) 0)) (= (select .cse28 .cse3) 0) (< .cse22 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (< v_subst_2 .cse22) (< .cse22 v_subst_2))))))) (or .cse27 (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse36 (let ((.cse38 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse38 .cse4) 1))))) (let ((.cse34 (let ((.cse37 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse36 .cse37 (+ (select .cse36 .cse37) 1))))) (or (not (= (select .cse34 .cse4) 0)) (= (select .cse34 .cse3) 0) (< v_subst_2 .cse22) (< .cse22 v_subst_2) (< (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ 3 |c_ULTIMATE.start_main_~i~0#1|)))))))) (forall ((v_ArrVal_794 Int) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_1 Int)) (let ((.cse43 (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse41 (store (store (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse39 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (let ((.cse42 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse41 .cse42 (+ (- 1) (select .cse41 .cse42)))))) (or (< .cse17 .cse39) (not (= (select .cse40 .cse4) 0)) (not (< .cse22 .cse39)) (< (+ v_subst_1 1) .cse39) (not (< v_subst_1 .cse39)) (not (< 2 .cse39)) (= (select .cse40 .cse3) 0)))))) (or .cse13 (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse45 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse46 (let ((.cse48 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse48 .cse4) 1))))) (let ((.cse44 (let ((.cse47 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse46 .cse47 (+ (select .cse46 .cse47) 1))))) (or (= (select .cse44 .cse3) 0) (< v_subst_2 |c_ULTIMATE.start_main_~i~0#1|) (not (= (select .cse44 .cse4) 0)) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (< |c_ULTIMATE.start_main_~i~0#1| (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (or .cse11 .cse12 (= (select .cse49 .cse3) 0) (not (= (select .cse49 .cse4) 0))))))) is different from false [2022-11-25 23:45:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:45:19,867 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-11-25 23:45:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 23:45:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 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 23 [2022-11-25 23:45:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:45:19,868 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:45:19,869 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 23:45:19,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 22 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 180.2s TimeCoverageRelationStatistics Valid=850, Invalid=6438, Unknown=30, NotChecked=338, Total=7656 [2022-11-25 23:45:19,871 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 91 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:45:19,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 573 Invalid, 22 Unknown, 43 Unchecked, 25.5s Time] [2022-11-25 23:45:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 23:45:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-11-25 23:45:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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-25 23:45:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-11-25 23:45:19,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 23 [2022-11-25 23:45:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:45:19,898 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-11-25 23:45:19,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 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-25 23:45:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-11-25 23:45:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:45:19,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:45:19,899 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:45:19,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:45:20,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:45:20,106 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:45:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:45:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1713112672, now seen corresponding path program 11 times [2022-11-25 23:45:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:45:20,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629809796] [2022-11-25 23:45:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:45:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:45:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:45:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:24,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:45:24,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629809796] [2022-11-25 23:45:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629809796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:45:24,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131849342] [2022-11-25 23:45:24,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:45:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:45:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:45:24,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:45:24,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d92f5a1-7a74-476e-b5b8-0a793ea077db/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:45:24,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 23:45:24,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:45:24,443 WARN L261 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-25 23:45:24,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:45:24,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:45:24,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:45:24,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:45:24,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:45:24,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,741 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 42 [2022-11-25 23:45:24,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,875 INFO L321 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-11-25 23:45:24,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2022-11-25 23:45:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:24,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,036 INFO L321 Elim1Store]: treesize reduction 94, result has 21.7 percent of original size [2022-11-25 23:45:25,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 71 [2022-11-25 23:45:25,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:25,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,364 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-11-25 23:45:25,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 81 [2022-11-25 23:45:25,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:25,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,557 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-25 23:45:25,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 84 [2022-11-25 23:45:25,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,741 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-11-25 23:45:25,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 78 [2022-11-25 23:45:25,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:25,936 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-11-25 23:45:25,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 91 [2022-11-25 23:45:26,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,163 INFO L321 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2022-11-25 23:45:26,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 106 treesize of output 103 [2022-11-25 23:45:26,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 140 [2022-11-25 23:45:26,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:26,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:26,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:26,724 INFO L321 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-11-25 23:45:26,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 95 treesize of output 90 [2022-11-25 23:45:26,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-25 23:45:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:27,684 INFO L321 Elim1Store]: treesize reduction 134, result has 44.9 percent of original size [2022-11-25 23:45:27,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 248 treesize of output 325 [2022-11-25 23:45:27,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,706 INFO L350 Elim1Store]: Elim1 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 155 treesize of output 145 [2022-11-25 23:45:27,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:27,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:27,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 183 [2022-11-25 23:45:29,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 285 [2022-11-25 23:45:29,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:29,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:29,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 277 treesize of output 376 [2022-11-25 23:45:30,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-11-25 23:45:30,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:30,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:30,844 INFO L321 Elim1Store]: treesize reduction 77, result has 42.1 percent of original size [2022-11-25 23:45:30,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 157 treesize of output 183 [2022-11-25 23:45:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:30,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:30,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:30,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 168 [2022-11-25 23:45:31,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2022-11-25 23:45:31,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:31,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:31,922 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-25 23:45:31,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 24 [2022-11-25 23:45:32,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-11-25 23:45:32,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,186 INFO L321 Elim1Store]: treesize reduction 77, result has 31.9 percent of original size [2022-11-25 23:45:32,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 117 [2022-11-25 23:45:32,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66 [2022-11-25 23:45:32,356 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:45:32,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 114 [2022-11-25 23:45:32,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,610 INFO L321 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-11-25 23:45:32,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 87 [2022-11-25 23:45:32,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 88 [2022-11-25 23:45:32,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:32,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-25 23:45:33,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:33,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:33,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:33,052 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 12 [2022-11-25 23:45:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:33,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:33,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:45:34,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-25 23:45:34,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:34,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-11-25 23:45:34,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2022-11-25 23:46:22,301 WARN L233 SmtUtils]: Spent 46.02s on a formula simplification. DAG size of input: 102 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:47:20,999 WARN L233 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:47:59,082 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 197 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:48:31,999 WARN L233 SmtUtils]: Spent 11.60s on a formula simplification that was a NOOP. DAG size: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:49:10,367 WARN L233 SmtUtils]: Spent 10.58s on a formula simplification that was a NOOP. DAG size: 204 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:49:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:10,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131849342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:10,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [150614034] [2022-11-25 23:49:10,473 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-25 23:49:10,473 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:10,473 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:10,474 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:10,474 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:10,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,837 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-25 23:49:10,837 INFO L350 Elim1Store]: Elim1 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-25 23:49:10,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-25 23:49:10,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,908 INFO L350 Elim1Store]: Elim1 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-25 23:49:10,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:10,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 37 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 123 [2022-11-25 23:49:11,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:11,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:11,320 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-25 23:49:11,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 41 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 448 treesize of output 436 [2022-11-25 23:49:11,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 23:49:11,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:11,639 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-25 23:49:11,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2022-11-25 23:49:11,870 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-25 23:49:11,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-25 23:49:11,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:12,029 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:49:12,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-11-25 23:49:12,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:12,102 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-11-25 23:49:12,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-25 23:49:12,319 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-25 23:49:12,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2022-11-25 23:49:12,441 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-11-25 23:49:12,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:49:12,491 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:21,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4123#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem15#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_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem15#1| 0) 1 0)) (= |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))' at error location [2022-11-25 23:49:21,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:49:21,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:21,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2022-11-25 23:49:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281201932] [2022-11-25 23:49:21,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:49:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-25 23:49:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-25 23:49:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=3860, Unknown=24, NotChecked=0, Total=4290 [2022-11-25 23:49:21,589 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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-25 23:49:31,283 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse41 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse30 (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse0 .cse30))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (not (< 4 c_~N~0))) (.cse17 (< 5 c_~N~0)) (.cse29 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse42 (select .cse0 .cse28)) (.cse31 (+ .cse41 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 0) 1) (or .cse1 (and (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse6 (* 4 v_subst_5))) (let ((.cse4 (select .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse6)) .cse4 .cse5)))) (not (< (+ v_subst_5 1) c_~N~0)))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (* 4 v_subst_3))) (let ((.cse8 (select .cse7 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse8 .cse5))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (* 4 v_subst_4))) (let ((.cse15 (select .cse7 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse15 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse15 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse11 .cse12)))) .cse13 v_ArrVal_928) .cse14 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse17) (= (select .cse0 .cse13) 1) (= .cse2 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse1 .cse17 (let ((.cse18 (select .cse7 .cse28))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse18 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (* 4 v_subst_3))) (let ((.cse19 (select .cse21 (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse18 .cse5 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse5 .cse19))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse25 (* 4 v_subst_4))) (let ((.cse24 (select .cse21 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse24 .cse18 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse24 .cse18 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse23 .cse12)))) .cse13 v_ArrVal_928) .cse14 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse27 (* 4 v_subst_5))) (let ((.cse26 (select .cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27)))) (+ .cse2 .cse18 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse18 .cse5 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse27)) .cse26)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) (or (not .cse29) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse0 .cse30 v_ArrVal_928) .cse28 v_ArrVal_932) .cse31 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse30 v_ArrVal_928) .cse28 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (< 1 c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse32 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse0 (+ .cse32 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse0 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse36 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse35 (select .cse0 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse35))))))) (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse34 .cse12)))) .cse13 v_ArrVal_928) .cse14 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse38 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse37 (select .cse0 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse37))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse40 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse39 (select .cse0 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse39)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse1 .cse17) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or (<= (+ .cse41 9 |c_ULTIMATE.start_main_~a~0#1.offset|) (* c_~N~0 4)) (and (<= .cse2 3) (= .cse42 1) (= .cse5 1) (<= 3 .cse2) (= c_~N~0 5))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse29 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (and (forall ((v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= 0 (select (store (store .cse0 .cse30 v_ArrVal_932) .cse28 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse30 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (= (select .cse0 .cse12) 1) (or (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (let ((.cse45 (+ .cse41 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse46 (+ .cse41 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (= .cse2 c_~N~0))) (and (or (not .cse43) (let ((.cse44 (store (store .cse0 .cse30 (+ (- 1) .cse5)) .cse28 (+ (- 1) .cse42)))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse44 .cse31 v_ArrVal_928) .cse45 v_ArrVal_932) .cse46 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse44 .cse31 v_ArrVal_928) .cse45 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (or (and (forall ((v_ArrVal_920 (Array Int Int))) (or (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse28 (+ (- 1) (select v_ArrVal_920 .cse28))) .cse31 v_ArrVal_928) .cse45 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse28 (+ (select v_ArrVal_920 .cse28) 1)) .cse31 v_ArrVal_928) .cse45 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse28 (+ (select v_ArrVal_920 .cse28) 1)) .cse31 v_ArrVal_928) .cse45 v_ArrVal_932) .cse46 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse28 (+ (- 1) (select v_ArrVal_920 .cse28))) .cse31 v_ArrVal_928) .cse45 v_ArrVal_932) .cse46 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse43))))))))) is different from true [2022-11-25 23:49:40,191 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse54 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse1 .cse54)) (.cse55 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse14 (store .cse1 .cse54 1)) (.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse55))) (let ((.cse0 (select .cse1 (+ .cse40 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse90 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse68 (store .cse14 .cse55 1)) (.cse56 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (not (< 4 c_~N~0))) (.cse28 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse39 (< 5 c_~N~0))) (and (= .cse0 1) (= (select .cse1 0) 1) (= (select .cse1 .cse2) 1) (or .cse3 (and (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse13 (let ((.cse15 (* 4 v_subst_6))) (store (store .cse14 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse10 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse11 (* 4 v_subst_3))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse8 .cse9 .cse10)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (< (+ 2 v_subst_6) c_~N~0))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= (let ((.cse24 (let ((.cse25 (* 4 v_subst_8))) (store (store .cse14 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse16 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse23 (* 4 v_subst_5))) (let ((.cse17 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)))) (+ .cse16 .cse17 .cse18 .cse19 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse23)))))))))) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_7 Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse26 (let ((.cse37 (let ((.cse38 (* 4 v_subst_7))) (store (store .cse14 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse36 (* 4 v_subst_4))) (let ((.cse32 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse31 .cse32 .cse33 .cse34 .cse35)))))))))))) (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse27 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (< (+ 2 v_subst_7) c_~N~0) (not (< (+ v_subst_7 1) c_~N~0))))) .cse39) (= (select .cse1 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (= .cse41 (+ .cse0 1)) (or .cse3 .cse39 (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (* 4 v_subst_3))) (let ((.cse45 (select .cse47 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse44 .cse45))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse51 (* 4 v_subst_4))) (let ((.cse50 (select .cse47 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse50 .cse43 .cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse50 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse49 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse53 (* 4 v_subst_5))) (let ((.cse52 (select .cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse53)))) (+ .cse41 .cse43 .cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse53)) .cse52)))) (not (< (+ v_subst_5 1) c_~N~0)))))) (or (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse1 .cse54 v_ArrVal_928) .cse55 v_ArrVal_932) .cse56 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse54 v_ArrVal_928) .cse55 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (< 1 c_~N~0) (or (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse57 (let ((.cse67 (let ((.cse69 (* 4 v_subst_7))) (store (store .cse68 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse67))) (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse63 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse64 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse62 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse66 (* 4 v_subst_4))) (let ((.cse65 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse61 .cse62 .cse63 .cse64 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse65)))))))))))) (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse58 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse78 (let ((.cse79 (* 4 v_subst_6))) (store (store .cse68 (+ .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse79 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse78))) (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse73 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse76 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse75 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse74 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse77 (* 4 v_subst_3))) (let ((.cse72 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse72 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse73 .cse74 .cse75 .cse76)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)) (= c_~N~0 (let ((.cse88 (let ((.cse89 (* 4 v_subst_8))) (store (store .cse68 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse88))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse80 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse86 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse87 (* 4 v_subst_5))) (let ((.cse85 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse87)))) (+ .cse80 .cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84 .cse85 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse87)) .cse84 .cse85 .cse86))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0))))) .cse3 (not .cse90) .cse39) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse91 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse1 (+ .cse91 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse1 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse90 (= 0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse95 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse94 (select .cse1 (+ .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse95 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse94))))))) (store .cse92 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse93 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse93 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse97 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse96 (select .cse1 (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse96))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse99 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse98 (select .cse1 (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse98))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse99 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse98)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse3 .cse39) (or .cse3 (let ((.cse100 (select .cse47 .cse56))) (let ((.cse103 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse102 (* 4 v_subst_3))) (let ((.cse101 (select .cse103 (+ .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse43 .cse44 .cse100 .cse101 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse100 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse102 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse107 (* 4 v_subst_4))) (let ((.cse106 (select .cse103 (+ .cse107 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse100 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse107 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse41 .cse43 .cse44 .cse100 .cse106))))))) (store .cse104 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse105 (select .cse104 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse105 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse105 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (select .cse105 .cse12) (- 1)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse109 (* 4 v_subst_5))) (let ((.cse108 (select .cse103 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse109)))) (+ .cse41 .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse108 .cse43 .cse44 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse109)) .cse43 .cse44 .cse100)))) (not (< (+ v_subst_5 1) c_~N~0))))))) .cse39) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (<= (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 4)) (and (= c_~N~0 5) (= .cse41 c_~N~0))) (or .cse3 (let ((.cse121 (store .cse68 .cse56 1))) (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse110 (let ((.cse120 (let ((.cse122 (* 4 v_subst_7))) (store (store .cse121 (+ .cse122 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse122 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse112 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse120))) (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse113 (select .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse114 (select .cse120 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse115 (select .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse117 (select (select (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse118 (select (select (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115 .cse117))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse119 (* 4 v_subst_4))) (let ((.cse116 (select (select (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115 .cse117 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse119 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse114 (select (select (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115 .cse116 .cse117 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse119 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse115 .cse116 .cse117 .cse118)))))))))))) (store .cse110 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse111 (select .cse110 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse111 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse111 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse111 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse131 (let ((.cse132 (* 4 v_subst_8))) (store (store .cse121 (+ .cse132 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse132 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse131))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse126 (select .cse131 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse127 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse124 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse123 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse124 .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (* 4 v_subst_5))) (let ((.cse125 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse123 .cse124 .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse130)))) (+ .cse123 .cse124 .cse125 .cse126 .cse127 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse123 .cse124 .cse125 .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse130))))))))))) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse141 (let ((.cse142 (* 4 v_subst_6))) (store (store .cse121 (+ .cse142 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse142 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse133 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse141))) (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse134 (select .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse136 (select .cse141 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse138 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse135 .cse136))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse137 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse135 .cse136 .cse138))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse140 (* 4 v_subst_3))) (let ((.cse139 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse135 .cse136 .cse137 .cse138))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse140 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse135 .cse136 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse135 .cse136 .cse137 .cse138 .cse139))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse140 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse137 .cse138 .cse139)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) .cse39) (or .cse3 (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse151 (let ((.cse152 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse152 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse152 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse143 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse151))) (let ((.cse144 (select .cse143 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse145 (select .cse144 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse148 (select .cse151 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse147 (select (select (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse144 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse145 .cse148))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse146 (select (select (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse144 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse145 .cse147 .cse148))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse150 (* 4 v_subst_5))) (let ((.cse149 (select (select (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse144 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse145 .cse146 .cse147 .cse148))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse150)))) (+ (select (select (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse144 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse145 .cse146 .cse147 .cse148 .cse149))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse150)) .cse145 .cse146 .cse147 .cse148 .cse149))))))))) (not (< (+ v_subst_5 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse161 (let ((.cse162 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse162 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse162 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse153 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse161))) (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse154 (select .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse155 (select .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse158 (select .cse161 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse157 (select (select (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse158))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse156 (select (select (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse157 .cse158))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse160 (* 4 v_subst_3))) (let ((.cse159 (select (select (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse156 .cse157 .cse158))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse160 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse155 .cse156 .cse157 .cse158 .cse159 (select (select (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse154 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse155 .cse156 .cse157 .cse158 .cse159))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse160 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse163 (let ((.cse173 (let ((.cse174 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse174 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse174 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse165 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse173))) (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse166 (select .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse168 (select .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse171 (select .cse173 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse170 (select (select (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse168 .cse171))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse169 (select (select (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse168 .cse170 .cse171))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse172 (* 4 v_subst_4))) (let ((.cse167 (select (select (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse168 .cse169 .cse170 .cse171))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse172 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse167 .cse168 .cse169 .cse170 (select (select (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse166 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse167 .cse168 .cse169 .cse170 .cse171))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse172 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse171)))))))))))) (store .cse163 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse164 (select .cse163 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse164 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse164 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse164 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse39))))))) is different from true [2022-11-25 23:49:42,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:49:45,422 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse44 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse17 .cse43))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (not (< 4 c_~N~0))) (.cse16 (< 5 c_~N~0)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse28 (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse5 (* 4 v_subst_5))) (let ((.cse3 (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse5)) .cse3 .cse4)))) (not (< (+ v_subst_5 1) c_~N~0)))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 4 v_subst_3))) (let ((.cse7 (select .cse6 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse7 .cse4))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (* 4 v_subst_4))) (let ((.cse14 (select .cse6 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse14 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse14 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse10 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse16) (= (select .cse17 .cse12) 1) (= .cse1 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse0 .cse16 (let ((.cse18 (select .cse6 .cse28))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse18 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (* 4 v_subst_3))) (let ((.cse19 (select .cse21 (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse18 .cse4 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse4 .cse19))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse25 (* 4 v_subst_4))) (let ((.cse24 (select .cse21 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse24 .cse18 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse24 .cse18 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse23 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse27 (* 4 v_subst_5))) (let ((.cse26 (select .cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27)))) (+ .cse1 .cse18 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse18 .cse4 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse27)) .cse26)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) (< 1 c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse29 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse17 (+ .cse29 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse17 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse33 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse32 (select .cse17 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse32))))))) (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse31 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse35 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse34 (select .cse17 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse34))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse37 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse36 (select .cse17 (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse36)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse0 .cse16) (= (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse17 .cse11) 1) (or (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (let ((.cse40 (+ .cse44 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (+ .cse44 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (+ .cse44 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (= .cse1 c_~N~0))) (and (or (not .cse38) (let ((.cse39 (store (store .cse17 .cse43 (+ (- 1) .cse4)) .cse28 (+ (- 1) (select .cse17 .cse28))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse39 .cse40 v_ArrVal_928) .cse41 v_ArrVal_932) .cse42 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse39 .cse40 v_ArrVal_928) .cse41 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (or (and (forall ((v_ArrVal_920 (Array Int Int))) (or (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse28 (+ (- 1) (select v_ArrVal_920 .cse28))) .cse40 v_ArrVal_928) .cse41 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse28 (+ (select v_ArrVal_920 .cse28) 1)) .cse40 v_ArrVal_928) .cse41 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse28 (+ (select v_ArrVal_920 .cse28) 1)) .cse40 v_ArrVal_928) .cse41 v_ArrVal_932) .cse42 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse28 (+ (- 1) (select v_ArrVal_920 .cse28))) .cse40 v_ArrVal_928) .cse41 v_ArrVal_932) .cse42 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse38))))))))) is different from true [2022-11-25 23:50:01,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:50:10,957 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 190 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:50:15,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:17,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:19,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:21,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:23,998 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (= .cse2 1)) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select .cse1 .cse5)) (.cse4 (select .cse1 .cse3)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (not (< 4 c_~N~0))) (.cse8 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse10 (< 5 c_~N~0))) (and (or (and .cse0 (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse2)) .cse3 (+ (- 1) .cse4)) .cse5 v_ArrVal_928) .cse6 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse7 c_~N~0)) .cse8 .cse9 .cse10) (or .cse9 (let ((.cse13 (select .cse1 .cse22))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse14 (* 4 v_subst_5))) (let ((.cse12 (select .cse15 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse14)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse14)) .cse12 .cse13)))) (not (< (+ v_subst_5 1) c_~N~0)))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse17 (* 4 v_subst_3))) (let ((.cse16 (select .cse15 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse16 .cse13))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (* 4 v_subst_4))) (let ((.cse20 (select .cse15 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 .cse20 .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse20 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse19 .cse3)))) .cse5 v_ArrVal_928) .cse6 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) .cse10) (= .cse23 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (or .cse8 .cse9 (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse27 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse26 .cse27 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse29 (* 4 v_subst_4))) (let ((.cse28 (select .cse30 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse26 .cse27 .cse28 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse26 .cse27 .cse28 .cse2))))))) (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse25 .cse3)))) .cse5 v_ArrVal_928) .cse6 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse32 (* 4 v_subst_3))) (let ((.cse31 (select .cse30 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 .cse31 .cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse31 .cse26 .cse27 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse27 .cse2))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse34 (* 4 v_subst_5))) (let ((.cse33 (select .cse30 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse33 .cse26 .cse27 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse34)) .cse33 .cse26 .cse27 .cse2)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse10) (< 1 c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse35 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse1 (+ .cse35 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse1 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse39 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse38 (select .cse1 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse38))))))) (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse37 .cse3)))) .cse5 v_ArrVal_928) .cse6 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse41 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse40 (select .cse1 (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse40))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse43 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse42 (select .cse1 (+ .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse42)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse9 .cse10) .cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse7 (+ .cse23 .cse4 (select .cse1 (+ .cse44 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (= .cse4 1) (or (let ((.cse60 (store .cse1 .cse22 1))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse60))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse51 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse50 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse51 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse55 (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse45 (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse54 (* 4 v_subst_4))) (let ((.cse52 (select .cse55 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse49 .cse50 .cse51 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse52 .cse53))))))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse46 .cse3)))) .cse5 v_ArrVal_928) .cse6 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse57 (* 4 v_subst_3))) (let ((.cse56 (select .cse55 (+ .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse56 .cse49 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse49 .cse50 .cse51 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse50 .cse51 .cse53))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse59 (* 4 v_subst_5))) (let ((.cse58 (select .cse55 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse59)))) (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse58 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse59)) .cse49 .cse50 .cse51 .cse58 .cse53)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) .cse9 (not .cse8) .cse10))))) is different from true [2022-11-25 23:50:26,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:28,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:29,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:31,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:33,499 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (select .cse0 .cse23)) (.cse34 (= .cse2 c_~N~0)) (.cse4 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse24 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select .cse0 .cse9)) (.cse15 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse0 .cse8)) (.cse30 (select .cse0 .cse24)) (.cse29 (* c_~N~0 4)) (.cse32 (= c_~N~0 5)) (.cse10 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (not (< 4 c_~N~0))) (.cse35 (not .cse4)) (.cse22 (< 5 c_~N~0)) (.cse37 (not .cse34)) (.cse39 (+ .cse28 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (store .cse0 .cse23 (+ (- 1) .cse31))) (.cse25 (+ .cse28 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse36 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0))) (and (= (select .cse0 0) 1) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (= .cse2 (+ .cse1 .cse3 1)) (or .cse4 .cse5 (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (* 4 v_subst_4))) (let ((.cse14 (select .cse17 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12 .cse13 .cse14 .cse15))))))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse8 (+ (- 1) (select .cse7 .cse8)))) .cse9 v_ArrVal_928) .cse10 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (* 4 v_subst_3))) (let ((.cse18 (select .cse17 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse18 .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse18 .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse15))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse21 (* 4 v_subst_5))) (let ((.cse20 (select .cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse21)))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse20 .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse21)) .cse20 .cse12 .cse13 .cse15)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse22) (or (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse0 .cse23 v_ArrVal_928) .cse24 v_ArrVal_932) .cse25 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse23 v_ArrVal_928) .cse24 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) .cse26) (< 1 c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse27 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse0 (+ .cse27 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse0 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse4 (= 0 .cse15)) (= .cse15 1) (or (<= (+ .cse28 9 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse29) (and (<= .cse2 3) (= .cse30 1) (= .cse31 1) (<= 3 .cse2) .cse32)) (or .cse33 (and (forall ((v_ArrVal_933 Int)) (= (select (store .cse0 .cse23 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse34) .cse35) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse3 1) (or (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not .cse36) (let ((.cse40 (+ .cse28 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse37 (let ((.cse38 (store .cse41 .cse24 (+ (- 1) .cse30)))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse38 .cse25 v_ArrVal_928) .cse39 v_ArrVal_932) .cse40 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse25 v_ArrVal_928) .cse39 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (or (and (forall ((v_ArrVal_920 (Array Int Int))) (or (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse24 (+ (- 1) (select v_ArrVal_920 .cse24))) .cse25 v_ArrVal_928) .cse39 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse24 (+ (select v_ArrVal_920 .cse24) 1)) .cse25 v_ArrVal_928) .cse39 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse24 (+ (select v_ArrVal_920 .cse24) 1)) .cse25 v_ArrVal_928) .cse39 v_ArrVal_932) .cse40 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse24 (+ (- 1) (select v_ArrVal_920 .cse24))) .cse25 v_ArrVal_928) .cse39 v_ArrVal_932) .cse40 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse34)))) (or (and (= (+ .cse2 .cse31) 5) .cse32) (<= (+ 5 .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse29)) (or (<= (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse29) (and .cse32 .cse34)) (or (let ((.cse57 (store .cse0 .cse23 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (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 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse52 (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse42 (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse51 (* 4 v_subst_4))) (let ((.cse49 (select .cse52 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse46 .cse47 .cse48 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse49 .cse50))))))) (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse8 (+ (- 1) (select .cse43 .cse8)))) .cse9 v_ArrVal_928) .cse10 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse54 (* 4 v_subst_3))) (let ((.cse53 (select .cse52 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse53 .cse46 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse46 .cse47 .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse47 .cse48 .cse50))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse56 (* 4 v_subst_5))) (let ((.cse55 (select .cse52 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse56)))) (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48 .cse55 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse56)) .cse46 .cse47 .cse48 .cse55 .cse50)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse33 .cse5 .cse35 .cse22) (or (and (or (let ((.cse58 (store .cse0 .cse23 (+ .cse31 1)))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse58 .cse24 v_ArrVal_928) .cse25 v_ArrVal_932) .cse39 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse58 .cse24 v_ArrVal_928) .cse25 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) .cse34) (or .cse37 (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse41 .cse24 v_ArrVal_928) .cse25 v_ArrVal_932) .cse39 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 .cse24 v_ArrVal_928) .cse25 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (not .cse26) .cse36)))))) is different from true [2022-11-25 23:50:35,612 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse54 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse1 .cse54)) (.cse55 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse14 (store .cse1 .cse54 1)) (.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse55))) (let ((.cse0 (select .cse1 (+ .cse40 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse68 (store .cse14 .cse55 1)) (.cse56 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (not (< 4 c_~N~0))) (.cse28 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse39 (< 5 c_~N~0))) (and (= .cse0 1) (= (select .cse1 .cse2) 1) (or .cse3 (and (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse13 (let ((.cse15 (* 4 v_subst_6))) (store (store .cse14 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse10 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse11 (* 4 v_subst_3))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse8 .cse9 .cse10)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (< (+ 2 v_subst_6) c_~N~0))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= (let ((.cse24 (let ((.cse25 (* 4 v_subst_8))) (store (store .cse14 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse16 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse23 (* 4 v_subst_5))) (let ((.cse17 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)))) (+ .cse16 .cse17 .cse18 .cse19 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse23)))))))))) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_7 Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse26 (let ((.cse37 (let ((.cse38 (* 4 v_subst_7))) (store (store .cse14 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse36 (* 4 v_subst_4))) (let ((.cse32 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse31 .cse32 .cse33 .cse34 .cse35)))))))))))) (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse27 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (< (+ 2 v_subst_7) c_~N~0) (not (< (+ v_subst_7 1) c_~N~0))))) .cse39) (= (select .cse1 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) (= .cse41 (+ .cse0 1)) (or .cse3 .cse39 (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (* 4 v_subst_3))) (let ((.cse45 (select .cse47 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse44 .cse45))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse51 (* 4 v_subst_4))) (let ((.cse50 (select .cse47 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse50 .cse43 .cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse50 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse49 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse53 (* 4 v_subst_5))) (let ((.cse52 (select .cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse53)))) (+ .cse41 .cse43 .cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse53)) .cse52)))) (not (< (+ v_subst_5 1) c_~N~0)))))) (or (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse1 .cse54 v_ArrVal_928) .cse55 v_ArrVal_932) .cse56 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse54 v_ArrVal_928) .cse55 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (< 1 c_~N~0) (or (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse57 (let ((.cse67 (let ((.cse69 (* 4 v_subst_7))) (store (store .cse68 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse67))) (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse63 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse64 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse62 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse66 (* 4 v_subst_4))) (let ((.cse65 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse61 .cse62 .cse63 .cse64 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse65)))))))))))) (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse58 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse78 (let ((.cse79 (* 4 v_subst_6))) (store (store .cse68 (+ .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse79 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse78))) (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse73 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse76 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse75 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse74 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse77 (* 4 v_subst_3))) (let ((.cse72 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse72 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse73 .cse74 .cse75 .cse76)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)) (= c_~N~0 (let ((.cse88 (let ((.cse89 (* 4 v_subst_8))) (store (store .cse68 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse88))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse80 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse86 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse87 (* 4 v_subst_5))) (let ((.cse85 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse87)))) (+ .cse80 .cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse84 .cse85 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse87)) .cse84 .cse85 .cse86))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0))))) .cse3 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse39) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse90 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse1 (+ .cse90 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse1 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse94 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse93 (select .cse1 (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse93))))))) (store .cse91 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse92 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse92 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse92 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse96 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse95 (select .cse1 (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse95))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse98 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse97 (select .cse1 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse97)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse3 .cse39) (or .cse3 (let ((.cse99 (select .cse47 .cse56))) (let ((.cse102 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse101 (* 4 v_subst_3))) (let ((.cse100 (select .cse102 (+ .cse101 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse43 .cse44 .cse99 .cse100 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse99 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse101 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse106 (* 4 v_subst_4))) (let ((.cse105 (select .cse102 (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse44 .cse99 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse41 .cse43 .cse44 .cse99 .cse105))))))) (store .cse103 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse104 (select .cse103 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse104 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse104 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (select .cse104 .cse12) (- 1)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse108 (* 4 v_subst_5))) (let ((.cse107 (select .cse102 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse108)))) (+ .cse41 .cse107 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse107 .cse43 .cse44 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse108)) .cse43 .cse44 .cse99)))) (not (< (+ v_subst_5 1) c_~N~0))))))) .cse39) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse3 (let ((.cse120 (store .cse68 .cse56 1))) (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse109 (let ((.cse119 (let ((.cse121 (* 4 v_subst_7))) (store (store .cse120 (+ .cse121 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse121 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse119))) (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse112 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse113 (select .cse119 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse114 (select .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse116 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse117 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse116))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse118 (* 4 v_subst_4))) (let ((.cse115 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse116 .cse117))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse118 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse113 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse115 .cse116 .cse117))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse118 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse114 .cse115 .cse116 .cse117)))))))))))) (store .cse109 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse110 (select .cse109 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse110 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse110 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse110 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse130 (let ((.cse131 (* 4 v_subst_8))) (store (store .cse120 (+ .cse131 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse131 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse127 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse130))) (let ((.cse128 (select .cse127 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse125 (select .cse130 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse126 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse123 (select (select (store .cse127 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse126))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse122 (select (select (store .cse127 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse123 .cse125 .cse126))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse129 (* 4 v_subst_5))) (let ((.cse124 (select (select (store .cse127 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse123 .cse125 .cse126))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse129)))) (+ .cse122 .cse123 .cse124 .cse125 .cse126 (select (select (store .cse127 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse122 .cse123 .cse124 .cse125 .cse126))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse129))))))))))) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse140 (let ((.cse141 (* 4 v_subst_6))) (store (store .cse120 (+ .cse141 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse141 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse132 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse140))) (store .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse133 (select .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse134 (select .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse135 (select .cse140 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse137 (select (select (store .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse134 .cse135))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse136 (select (select (store .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse134 .cse135 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse139 (* 4 v_subst_3))) (let ((.cse138 (select (select (store .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse134 .cse135 .cse136 .cse137))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse134 .cse135 (select (select (store .cse132 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse134 .cse135 .cse136 .cse137 .cse138))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse139 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse136 .cse137 .cse138)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) .cse39) (or .cse3 (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse150 (let ((.cse151 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse151 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse151 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse142 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse150))) (let ((.cse143 (select .cse142 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse144 (select .cse143 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse147 (select .cse150 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse146 (select (select (store .cse142 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse147))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse145 (select (select (store .cse142 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse146 .cse147))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse149 (* 4 v_subst_5))) (let ((.cse148 (select (select (store .cse142 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse145 .cse146 .cse147))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse149)))) (+ (select (select (store .cse142 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse143 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse144 .cse145 .cse146 .cse147 .cse148))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse149)) .cse144 .cse145 .cse146 .cse147 .cse148))))))))) (not (< (+ v_subst_5 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse160 (let ((.cse161 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse161 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse161 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse152 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse160))) (store .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse153 (select .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse154 (select .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse157 (select .cse160 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse156 (select (select (store .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse154 .cse157))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse155 (select (select (store .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse154 .cse156 .cse157))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse159 (* 4 v_subst_3))) (let ((.cse158 (select (select (store .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse154 .cse155 .cse156 .cse157))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse159 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse154 .cse155 .cse156 .cse157 .cse158 (select (select (store .cse152 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse153 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse154 .cse155 .cse156 .cse157 .cse158))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse159 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse162 (let ((.cse172 (let ((.cse173 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse1 (+ .cse173 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse173 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse164 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse172))) (store .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse165 (select .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse167 (select .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse170 (select .cse172 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse169 (select (select (store .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse167 .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse168 (select (select (store .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse167 .cse169 .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse171 (* 4 v_subst_4))) (let ((.cse166 (select (select (store .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse167 .cse168 .cse169 .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse171 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse166 .cse167 .cse168 .cse169 (select (select (store .cse164 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse165 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse166 .cse167 .cse168 .cse169 .cse170))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse171 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse170)))))))))))) (store .cse162 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse163 (select .cse162 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse163 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse163 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse12 (+ (- 1) (select .cse163 .cse12)))) .cse2 v_ArrVal_928) .cse28 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse39))))))) is different from true [2022-11-25 23:50:44,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:50:46,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:50:50,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:50:52,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:55,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:03,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:25,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:40,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:41,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:48,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:51:52,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:54,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:55,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:57,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:26,384 WARN L233 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 233 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:52:27,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:30,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:33,120 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse117 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse150 (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse17 .cse150))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse97 (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse54 (select .cse6 .cse97))) (let ((.cse27 (store .cse17 .cse150 1)) (.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (not (< 4 c_~N~0))) (.cse13 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse16 (< 5 c_~N~0))) (and (or .cse0 (and (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse5 (* 4 v_subst_5))) (let ((.cse3 (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse5)) .cse3 .cse4)))) (not (< (+ v_subst_5 1) c_~N~0)))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 4 v_subst_3))) (let ((.cse7 (select .cse6 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse7 .cse4))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (* 4 v_subst_4))) (let ((.cse14 (select .cse6 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse14 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse14 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse10 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse16) (= (select .cse17 .cse12) 1) (or .cse0 (and (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse26 (let ((.cse28 (* 4 v_subst_6))) (store (store .cse27 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse24 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse25 (* 4 v_subst_3))) (let ((.cse20 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse20 .cse21 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse22 .cse23 .cse24)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (< (+ 2 v_subst_6) c_~N~0))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= (let ((.cse37 (let ((.cse38 (* 4 v_subst_8))) (store (store .cse27 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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|) .cse11))) (let ((.cse29 (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|) .cse12)) (.cse36 (* 4 v_subst_5))) (let ((.cse30 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse31 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse36)))) (+ .cse29 .cse30 .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| (+ .cse29 .cse30 .cse31 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse36)))))))))) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_7 Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse39 (let ((.cse49 (let ((.cse50 (* 4 v_subst_7))) (store (store .cse27 (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49))) (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse45 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse43 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse48 (* 4 v_subst_4))) (let ((.cse44 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse43 .cse44 .cse45 .cse46 .cse47)))))))))))) (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse40 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (< (+ 2 v_subst_7) c_~N~0) (not (< (+ v_subst_7 1) c_~N~0))))) .cse16) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~i~0#1_401| Int)) (let ((.cse53 (* |v_ULTIMATE.start_main_~i~0#1_401| 4))) (let ((.cse51 (select .cse17 (+ (- 4) .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse52 (select .cse17 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= .cse1 (+ .cse51 3 .cse52)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_401| 1)) (< |v_ULTIMATE.start_main_~i~0#1_401| c_~N~0) (= .cse1 (+ .cse51 (select .cse17 .cse11) 2 .cse52)))))) (<= (mod c_~N~0 4294967296) 536870911) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse0 .cse16 (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse56 (* 4 v_subst_3))) (let ((.cse55 (select .cse57 (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse4 .cse55))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse61 (* 4 v_subst_4))) (let ((.cse60 (select .cse57 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse60 .cse54 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse60 .cse54 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse59 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse63 (* 4 v_subst_5))) (let ((.cse62 (select .cse57 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse63)))) (+ .cse1 .cse54 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse63)) .cse62)))) (not (< (+ v_subst_5 1) c_~N~0)))))) (< 1 c_~N~0) (or (let ((.cse75 (store .cse27 .cse97 1))) (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse64 (let ((.cse74 (let ((.cse76 (* 4 v_subst_7))) (store (store .cse75 (+ .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse76 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse74))) (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse70 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse71 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse68 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse69 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse73 (* 4 v_subst_4))) (let ((.cse72 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse68 .cse69 .cse70 .cse71 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse70 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse72)))))))))))) (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse65 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse85 (let ((.cse86 (* 4 v_subst_6))) (store (store .cse75 (+ .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse86 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse78 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse80 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse83 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse82 (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse81 (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse84 (* 4 v_subst_3))) (let ((.cse79 (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse79 (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse80 .cse81 .cse82 .cse83)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)) (= c_~N~0 (let ((.cse95 (let ((.cse96 (* 4 v_subst_8))) (store (store .cse75 (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse95))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse91 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse93 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse94 (* 4 v_subst_5))) (let ((.cse92 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse91 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse94)))) (+ .cse87 .cse88 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse91 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse94)) .cse91 .cse92 .cse93))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)))))) .cse0 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse16) (exists ((|v_ULTIMATE.start_main_~i~0#1_395| Int)) (let ((.cse98 (* |v_ULTIMATE.start_main_~i~0#1_395| 4))) (and (< |v_ULTIMATE.start_main_~i~0#1_395| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_395| 1)) (= (select .cse17 (+ .cse98 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse17 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse102 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse101 (select .cse17 (+ .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse102 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse101))))))) (store .cse99 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse100 (select .cse99 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse100 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse100 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse104 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse103 (select .cse17 (+ .cse104 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse104 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse103))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (= c_~N~0 (let ((.cse106 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse105 (select .cse17 (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse105)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse0 .cse16) (= (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or .cse0 (let ((.cse107 (select .cse57 (+ .cse117 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse110 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4 .cse107))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse109 (* 4 v_subst_3))) (let ((.cse108 (select .cse110 (+ .cse109 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse54 .cse4 .cse107 .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4 .cse107 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse109 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse114 (* 4 v_subst_4))) (let ((.cse113 (select .cse110 (+ .cse114 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54 .cse4 .cse107 .cse113))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse114 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse1 .cse54 .cse4 .cse107 .cse113))))))) (store .cse111 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse112 (select .cse111 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse112 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse112 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (select .cse112 .cse11) (- 1)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse116 (* 4 v_subst_5))) (let ((.cse115 (select .cse110 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse116)))) (+ .cse1 .cse115 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse115 .cse54 .cse4 .cse107))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse116)) .cse54 .cse4 .cse107)))) (not (< (+ v_subst_5 1) c_~N~0))))))) .cse16) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse0 (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse126 (let ((.cse127 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse127 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse127 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse118 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse126))) (let ((.cse119 (select .cse118 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse123 (select .cse126 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse122 (select (select (store .cse118 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse123))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse121 (select (select (store .cse118 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse122 .cse123))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse125 (* 4 v_subst_5))) (let ((.cse124 (select (select (store .cse118 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse121 .cse122 .cse123))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse125)))) (+ (select (select (store .cse118 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse121 .cse122 .cse123 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse125)) .cse120 .cse121 .cse122 .cse123 .cse124))))))))) (not (< (+ v_subst_5 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse136 (let ((.cse137 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse137 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse137 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse136))) (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse130 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse133 (select .cse136 |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| (+ .cse130 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse131 (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse130 .cse132 .cse133))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse135 (* 4 v_subst_3))) (let ((.cse134 (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|) (+ .cse135 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse130 .cse131 .cse132 .cse133 .cse134 (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 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse135 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse138 (let ((.cse148 (let ((.cse149 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse149 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse149 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse140 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse148))) (store .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse141 (select .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse143 (select .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse146 (select .cse148 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse145 (select (select (store .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse143 .cse146))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse144 (select (select (store .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse143 .cse145 .cse146))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse147 (* 4 v_subst_4))) (let ((.cse142 (select (select (store .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse143 .cse144 .cse145 .cse146))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse147 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse142 .cse143 .cse144 .cse145 (select (select (store .cse140 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse142 .cse143 .cse144 .cse145 .cse146))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse147 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse146)))))))))))) (store .cse138 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse139 (select .cse138 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse139 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse139 .cse11)))) .cse12 v_ArrVal_928) .cse13 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) .cse16)))))))) is different from true [2022-11-25 23:52:35,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:38,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:40,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:42,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:45,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:47,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:48,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:53,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:59,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:01,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:03,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:06,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:08,611 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse46 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse45 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select .cse1 .cse45))) (let ((.cse26 (+ .cse12 .cse29))) (let ((.cse6 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse25 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse40 (+ .cse46 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (= .cse12 c_~N~0)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse22 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse7 (not (< 4 c_~N~0))) (.cse27 (not .cse6)) (.cse8 (< 5 c_~N~0))) (and (or (and (= .cse0 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse0)) .cse2 (+ (- 1) (select .cse1 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse5) .cse6 .cse7 .cse8) (or .cse6 .cse7 (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (* 4 v_subst_4))) (let ((.cse15 (select .cse17 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse14 .cse15 .cse0))))))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse10 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (* 4 v_subst_3))) (let ((.cse18 (select .cse17 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 .cse18 .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse18 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse14 .cse0))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse21 (* 4 v_subst_5))) (let ((.cse20 (select .cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse21)))) (+ .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse20 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse21)) .cse20 .cse13 .cse14 .cse0)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or .cse22 .cse7 (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse23 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse23)) .cse2 (+ (- 1) (select .cse25 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse26 c_~N~0))) .cse27 .cse8) (or .cse7 (let ((.cse28 (select .cse25 .cse41))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse32 (* 4 v_subst_3))) (let ((.cse31 (select .cse33 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 .cse28 .cse29 .cse30 .cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse28 .cse29 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse37 (* 4 v_subst_4))) (let ((.cse36 (select .cse33 (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse28 .cse29 .cse30 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12 .cse28 .cse29 .cse30 .cse36))))))) (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (select .cse35 .cse2) (- 1)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse39 (* 4 v_subst_5))) (let ((.cse38 (select .cse33 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse39)))) (+ .cse12 .cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse38 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse39)) .cse28 .cse29 .cse30)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (let ((.cse43 (+ .cse46 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (+ .cse46 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse5) (let ((.cse42 (store (store .cse1 .cse45 (+ (- 1) .cse29)) .cse41 (+ (- 1) (select .cse1 .cse41))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse42 .cse40 v_ArrVal_928) .cse43 v_ArrVal_932) .cse44 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse42 .cse40 v_ArrVal_928) .cse43 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (or (and (forall ((v_ArrVal_920 (Array Int Int))) (or (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse41 (+ (- 1) (select v_ArrVal_920 .cse41))) .cse40 v_ArrVal_928) .cse43 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse41 (+ (select v_ArrVal_920 .cse41) 1)) .cse40 v_ArrVal_928) .cse43 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse41 (+ (select v_ArrVal_920 .cse41) 1)) .cse40 v_ArrVal_928) .cse43 v_ArrVal_932) .cse44 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse41 (+ (- 1) (select v_ArrVal_920 .cse41))) .cse40 v_ArrVal_928) .cse43 v_ArrVal_932) .cse44 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse5)))) (or (let ((.cse62 (store .cse1 .cse45 1))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse62))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse55 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse52 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse53 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse57 (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse47 (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse56 (* 4 v_subst_4))) (let ((.cse54 (select .cse57 (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse51 .cse52 .cse53 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse54 .cse55))))))) (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse48 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse59 (* 4 v_subst_3))) (let ((.cse58 (select .cse57 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse58 .cse51 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse51 .cse52 .cse53 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse52 .cse53 .cse55))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse61 (* 4 v_subst_5))) (let ((.cse60 (select .cse57 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse61)))) (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse60 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse61)) .cse51 .cse52 .cse53 .cse60 .cse55)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse22 .cse7 .cse27 .cse8)))))))) is different from true [2022-11-25 23:53:09,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:14,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:53:15,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:53:16,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:53:21,989 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse33 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select .cse1 .cse33)) (.cse5 (= .cse12 c_~N~0)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse22 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse7 (not (< 4 c_~N~0))) (.cse28 (not .cse6)) (.cse8 (< 5 c_~N~0))) (and (or (and (= .cse0 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse0)) .cse2 (+ (- 1) (select .cse1 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse5) .cse6 .cse7 .cse8) (or .cse6 .cse7 (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (* 4 v_subst_4))) (let ((.cse15 (select .cse17 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse14 .cse15 .cse0))))))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse10 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (* 4 v_subst_3))) (let ((.cse18 (select .cse17 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 .cse18 .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse18 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse14 .cse0))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse21 (* 4 v_subst_5))) (let ((.cse20 (select .cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse21)))) (+ .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse20 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse21)) .cse20 .cse13 .cse14 .cse0)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or .cse22 .cse7 (let ((.cse26 (+ .cse12 .cse27))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26)))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse23 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse23)) .cse2 (+ (- 1) (select .cse25 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse26 c_~N~0)))))) .cse28 .cse8) (or (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (let ((.cse34 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse30 (+ .cse35 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse31 (+ .cse35 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (+ .cse35 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse5) (let ((.cse29 (store (store .cse1 .cse33 (+ (- 1) .cse27)) .cse34 (+ (- 1) (select .cse1 .cse34))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse29 .cse30 v_ArrVal_928) .cse31 v_ArrVal_932) .cse32 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse29 .cse30 v_ArrVal_928) .cse31 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (or (and (forall ((v_ArrVal_920 (Array Int Int))) (or (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse34 (+ (- 1) (select v_ArrVal_920 .cse34))) .cse30 v_ArrVal_928) .cse31 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store v_ArrVal_920 .cse34 (+ (select v_ArrVal_920 .cse34) 1)) .cse30 v_ArrVal_928) .cse31 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((v_ArrVal_920 (Array Int Int))) (or (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse34 (+ (select v_ArrVal_920 .cse34) 1)) .cse30 v_ArrVal_928) .cse31 v_ArrVal_932) .cse32 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_920 (Array Int Int))) (or (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store (store v_ArrVal_920 .cse34 (+ (- 1) (select v_ArrVal_920 .cse34))) .cse30 v_ArrVal_928) .cse31 v_ArrVal_932) .cse32 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) .cse5)))) (or (let ((.cse51 (store .cse1 .cse33 1))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse41 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse46 (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse45 (* 4 v_subst_4))) (let ((.cse43 (select .cse46 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse40 .cse41 .cse42 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse43 .cse44))))))) (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse37 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse48 (* 4 v_subst_3))) (let ((.cse47 (select .cse46 (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse47 .cse40 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse40 .cse41 .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse41 .cse42 .cse44))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse50 (* 4 v_subst_5))) (let ((.cse49 (select .cse46 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse50)))) (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse42 .cse49 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse50)) .cse40 .cse41 .cse42 .cse49 .cse44)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse22 .cse7 .cse28 .cse8))))) is different from true [2022-11-25 23:53:26,880 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse44 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse26 (select .cse1 .cse44)) (.cse4 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse7 (not (< 4 c_~N~0))) (.cse27 (not .cse6)) (.cse8 (< 5 c_~N~0))) (and (or (and (= .cse0 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse0)) .cse2 (+ (- 1) (select .cse1 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse5 c_~N~0)) .cse6 .cse7 .cse8) (or .cse6 .cse7 (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse13 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse12 .cse13 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (* 4 v_subst_4))) (let ((.cse14 (select .cse16 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse12 .cse13 .cse14 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12 .cse13 .cse14 .cse0))))))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse10 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse18 (* 4 v_subst_3))) (let ((.cse17 (select .cse16 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 .cse17 .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse17 .cse12 .cse13 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse0))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse20 (* 4 v_subst_5))) (let ((.cse19 (select .cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (+ .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse19 .cse12 .cse13 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse20)) .cse19 .cse12 .cse13 .cse0)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or .cse6 (= 0 .cse0)) (or .cse21 .cse7 (let ((.cse25 (+ .cse5 .cse26))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25)))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse22 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse22)) .cse2 (+ (- 1) (select .cse24 .cse2))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse25 c_~N~0)))))) .cse27 .cse8) (= .cse26 0) (or (let ((.cse43 (store .cse1 .cse44 1))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse38 (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse28 (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse37 (* 4 v_subst_4))) (let ((.cse35 (select .cse38 (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse32 .cse33 .cse34 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse35 .cse36))))))) (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse29 .cse2)))) .cse3 v_ArrVal_928) .cse4 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse40 (* 4 v_subst_3))) (let ((.cse39 (select .cse38 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse39 .cse32 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse32 .cse33 .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse33 .cse34 .cse36))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse42 (* 4 v_subst_5))) (let ((.cse41 (select .cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse42)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse41 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse42)) .cse32 .cse33 .cse34 .cse41 .cse36)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse21 .cse7 .cse27 .cse8)))) is different from true [2022-11-25 23:53:28,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:49,806 WARN L233 SmtUtils]: Spent 14.46s on a formula simplification. DAG size of input: 236 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:15,667 WARN L233 SmtUtils]: Spent 16.97s on a formula simplification. DAG size of input: 239 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:19,040 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse84 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse50 (+ .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (< 4 c_~N~0)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse100 (store .cse0 .cse50 1))) (let ((.cse18 (store .cse100 (+ .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse43 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse40 (not .cse4)) (.cse41 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse42 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse1) (not (= c_~N~0 .cse1))))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse2) (= c_~N~0 .cse2) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= (select .cse0 .cse3) 0) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) .cse4 (or (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse5 (let ((.cse17 (let ((.cse19 (* 4 v_subst_7))) (store (store .cse18 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (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 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse16 (* 4 v_subst_4))) (let ((.cse15 (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 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse11 .cse12 .cse13 .cse14 (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 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse15)))))))))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse6 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse28 (let ((.cse29 (* 4 v_subst_6))) (store (store .cse18 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse24 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse27 (* 4 v_subst_3))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse23 .cse24 .cse25 .cse26)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)) (= c_~N~0 (let ((.cse38 (let ((.cse39 (* 4 v_subst_8))) (store (store .cse18 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse36 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse37 (* 4 v_subst_5))) (let ((.cse35 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse37)))) (+ .cse30 .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse37)) .cse34 .cse35 .cse36))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0))))) .cse40 .cse41 .cse42) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) |c_ULTIMATE.start_main_~i~0#1|) (or .cse43 .cse40 (let ((.cse47 (+ .cse49 (select .cse0 .cse50)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse47)))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse44 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse44)) .cse3 (+ (- 1) (select .cse46 .cse3))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse47 c_~N~0)))))) .cse41 .cse42) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (<= |c_ULTIMATE.start_main_~i~0#1| 5) (or .cse40 (let ((.cse62 (store .cse18 (+ .cse84 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse51 (let ((.cse61 (let ((.cse63 (* 4 v_subst_7))) (store (store .cse62 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse55 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse59 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse60 (* 4 v_subst_4))) (let ((.cse57 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse55 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse56 .cse57 .cse58 .cse59)))))))))))) (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse52 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse72 (let ((.cse73 (* 4 v_subst_8))) (store (store .cse62 (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse72))) (let ((.cse70 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse67 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse68 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse65 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse64 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse71 (* 4 v_subst_5))) (let ((.cse66 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse71)))) (+ .cse64 .cse65 .cse66 .cse67 .cse68 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse71))))))))))) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse82 (let ((.cse83 (* 4 v_subst_6))) (store (store .cse62 (+ .cse83 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse83 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse78 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse81 (* 4 v_subst_3))) (let ((.cse80 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse76 .cse77 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78 .cse79 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse78 .cse79 .cse80)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))))) (not .cse43) .cse42) (= .cse49 c_~N~0) (or (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse100))) (let ((.cse88 (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse89 (select .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse93 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse91 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse90 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse91 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse95 (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse85 (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse94 (* 4 v_subst_4))) (let ((.cse92 (select .cse95 (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse89 .cse90 .cse91 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse92 .cse93))))))) (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse86 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse86 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse97 (* 4 v_subst_3))) (let ((.cse96 (select .cse95 (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse96 .cse89 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse96 .cse89 .cse90 .cse91 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse97 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse90 .cse91 .cse93))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse99 (* 4 v_subst_5))) (let ((.cse98 (select .cse95 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse99)))) (+ (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse98 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse99)) .cse89 .cse90 .cse91 .cse98 .cse93)))) (not (< (+ v_subst_5 1) c_~N~0))))))))))) .cse43 .cse40 .cse41 .cse42)))))) is different from true [2022-11-25 23:54:24,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:54:28,950 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse83 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse49 (+ .cse83 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (< 4 c_~N~0)) (.cse99 (store .cse2 .cse49 1))) (let ((.cse18 (store .cse99 (+ .cse83 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse43 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse40 (not .cse4)) (.cse41 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse42 (< 5 c_~N~0))) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse0) (not (= c_~N~0 .cse0))))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse1) (= c_~N~0 .cse1) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= (select .cse2 .cse3) 0) (= 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (<= (mod c_~N~0 4294967296) 536870911) .cse4 (or (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= (select (select (let ((.cse5 (let ((.cse17 (let ((.cse19 (* 4 v_subst_7))) (store (store .cse18 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (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 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse16 (* 4 v_subst_4))) (let ((.cse15 (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 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse11 .cse12 .cse13 .cse14 (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 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse15)))))))))))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse6 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse28 (let ((.cse29 (* 4 v_subst_6))) (store (store .cse18 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse24 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse27 (* 4 v_subst_3))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse23 .cse24 .cse25 .cse26)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))) (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (not (< (+ v_subst_5 1) c_~N~0)) (= c_~N~0 (let ((.cse38 (let ((.cse39 (* 4 v_subst_8))) (store (store .cse18 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse36 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse37 (* 4 v_subst_5))) (let ((.cse35 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse37)))) (+ .cse30 .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse37)) .cse34 .cse35 .cse36))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0))))) .cse40 .cse41 .cse42) (or .cse43 .cse40 (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (+ (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 .cse49)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse47)))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse44 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse44)) .cse3 (+ (- 1) (select .cse46 .cse3))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse47 c_~N~0))))))) .cse41 .cse42) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 5) (or .cse40 (let ((.cse61 (store .cse18 (+ .cse83 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (forall ((v_subst_7 Int)) (or (< (+ 2 v_subst_7) c_~N~0) (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (< (+ 2 v_subst_4) c_~N~0) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse50 (let ((.cse60 (let ((.cse62 (* 4 v_subst_7))) (store (store .cse61 (+ .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse60))) (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse54 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse55 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse58 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse59 (* 4 v_subst_4))) (let ((.cse56 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse54 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse55 .cse56 .cse57 .cse58)))))))))))) (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse51 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (not (< (+ v_subst_7 1) c_~N~0)))) (forall ((v_subst_8 Int)) (or (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0)) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse71 (let ((.cse72 (* 4 v_subst_8))) (store (store .cse61 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse67 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse63 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse70 (* 4 v_subst_5))) (let ((.cse65 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse70)))) (+ .cse63 .cse64 .cse65 .cse66 .cse67 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse70))))))))))) (not (< (+ v_subst_5 1) c_~N~0)))))) (forall ((v_subst_6 Int)) (or (not (< (+ v_subst_6 1) c_~N~0)) (< (+ 2 v_subst_6) c_~N~0) (forall ((v_subst_3 Int)) (or (< (+ 2 v_subst_3) c_~N~0) (= (select (select (let ((.cse81 (let ((.cse82 (* 4 v_subst_6))) (store (store .cse61 (+ .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse82 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse78 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse77 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse80 (* 4 v_subst_3))) (let ((.cse79 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse75 .cse76 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse77 .cse78 .cse79)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (< (+ v_subst_3 1) c_~N~0)))))))) (not .cse43) .cse42) (or (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse99))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse92 (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse90 (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse89 (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse94 (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse89 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_4 Int)) (or (not (< (+ v_subst_4 1) c_~N~0)) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (let ((.cse84 (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse93 (* 4 v_subst_4))) (let ((.cse91 (select .cse94 (+ .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse88 .cse89 .cse90 (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse89 .cse90 .cse91 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse93 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse91 .cse92))))))) (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse85 .cse3)))) .cse7 v_ArrVal_928) .cse8 v_ArrVal_932))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (< (+ 2 v_subst_4) c_~N~0))) (forall ((v_subst_3 Int)) (or (= (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse96 (* 4 v_subst_3))) (let ((.cse95 (select .cse94 (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse95 .cse88 (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse88 .cse89 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse96 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse89 .cse90 .cse92))))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ 2 v_subst_3) c_~N~0) (not (< (+ v_subst_3 1) c_~N~0)))) (forall ((v_subst_5 Int)) (or (< (+ 2 v_subst_5) c_~N~0) (= c_~N~0 (let ((.cse98 (* 4 v_subst_5))) (let ((.cse97 (select .cse94 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse98)))) (+ (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse89 .cse90 .cse97 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse98)) .cse88 .cse89 .cse90 .cse97 .cse92)))) (not (< (+ v_subst_5 1) c_~N~0))))))))))) .cse43 .cse40 .cse41 .cse42)))))) is different from true