./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 2329fc70 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_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/condg.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 07:26:36,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:26:36,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:26:36,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:26:36,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:26:36,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:26:36,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:26:36,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:26:36,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:26:36,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:26:36,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:26:36,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:26:36,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:26:36,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:26:36,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:26:36,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:26:36,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:26:36,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:26:36,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:26:36,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:26:36,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:26:36,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:26:36,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:26:36,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:26:36,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:26:36,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:26:36,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:26:36,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:26:36,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:26:36,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:26:36,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:26:36,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:26:36,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:26:36,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:26:36,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:26:36,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:26:36,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:26:36,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:26:36,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:26:36,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:26:36,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:26:36,799 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:26:36,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:26:36,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:26:36,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:26:36,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:26:36,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:26:36,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:26:36,820 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:26:36,821 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:26:36,821 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:26:36,821 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:26:36,821 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:26:36,821 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:26:36,822 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:26:36,822 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:26:36,822 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:26:36,822 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:26:36,822 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:26:36,822 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:26:36,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:26:36,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:26:36,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:26:36,825 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:26:36,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:26:36,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:26:36,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:26:36,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:26:36,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:26:36,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:26:36,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:26:36,826 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:26:36,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:26:36,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:26:36,827 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:26:36,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:26:36,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:26:36,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:26:36,827 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_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/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_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh 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-12-14 07:26:36,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:26:37,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:26:37,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:26:37,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:26:37,016 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:26:37,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-fpi/condg.c [2022-12-14 07:26:39,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:26:39,736 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:26:39,737 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/sv-benchmarks/c/array-fpi/condg.c [2022-12-14 07:26:39,743 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/data/a386ec398/9a7240fa39434ec5a0535ec5c1b149df/FLAGda4276e77 [2022-12-14 07:26:40,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/data/a386ec398/9a7240fa39434ec5a0535ec5c1b149df [2022-12-14 07:26:40,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:26:40,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:26:40,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:26:40,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:26:40,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:26:40,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a57efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40, skipping insertion in model container [2022-12-14 07:26:40,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:26:40,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:26:40,273 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_c0ba4990-c46d-41a4-976c-b5c38841e50d/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-12-14 07:26:40,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:26:40,294 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:26:40,303 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_c0ba4990-c46d-41a4-976c-b5c38841e50d/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-12-14 07:26:40,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:26:40,318 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:26:40,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40 WrapperNode [2022-12-14 07:26:40,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:26:40,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:26:40,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:26:40,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:26:40,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,343 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2022-12-14 07:26:40,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:26:40,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:26:40,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:26:40,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:26:40,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,360 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:26:40,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:26:40,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:26:40,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:26:40,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (1/1) ... [2022-12-14 07:26:40,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:26:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:40,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:26:40,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:26:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:26:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:26:40,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:26:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:26:40,471 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:26:40,472 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:26:40,591 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:26:40,631 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:26:40,631 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 07:26:40,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:26:40 BoogieIcfgContainer [2022-12-14 07:26:40,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:26:40,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:26:40,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:26:40,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:26:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:26:40" (1/3) ... [2022-12-14 07:26:40,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dc88f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:26:40, skipping insertion in model container [2022-12-14 07:26:40,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:26:40" (2/3) ... [2022-12-14 07:26:40,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dc88f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:26:40, skipping insertion in model container [2022-12-14 07:26:40,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:26:40" (3/3) ... [2022-12-14 07:26:40,641 INFO L112 eAbstractionObserver]: Analyzing ICFG condg.c [2022-12-14 07:26:40,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:26:40,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:26:40,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:26:40,716 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;@2e2702a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:26:40,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:26:40,726 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-12-14 07:26:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:26:40,733 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:40,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:40,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1910084069, now seen corresponding path program 1 times [2022-12-14 07:26:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:40,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456531709] [2022-12-14 07:26:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:40,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:40,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456531709] [2022-12-14 07:26:40,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456531709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:26:40,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:26:40,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:26:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575417615] [2022-12-14 07:26:40,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:26:40,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:26:40,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:26:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:26:41,000 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-12-14 07:26:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:41,046 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-12-14 07:26:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:26:41,048 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-12-14 07:26:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:41,054 INFO L225 Difference]: With dead ends: 22 [2022-12-14 07:26:41,054 INFO L226 Difference]: Without dead ends: 11 [2022-12-14 07:26:41,056 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-12-14 07:26:41,059 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-12-14 07:26:41,059 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-12-14 07:26:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-12-14 07:26:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-12-14 07:26:41,082 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-12-14 07:26:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-12-14 07:26:41,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2022-12-14 07:26:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:41,084 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-12-14 07:26:41,084 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-12-14 07:26:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-12-14 07:26:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:26:41,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:41,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:41,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:26:41,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1202687252, now seen corresponding path program 1 times [2022-12-14 07:26:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:41,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939830053] [2022-12-14 07:26:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:41,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:41,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939830053] [2022-12-14 07:26:41,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939830053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:26:41,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:26:41,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:26:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818682399] [2022-12-14 07:26:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:26:41,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:26:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:26:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:26:41,170 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-12-14 07:26:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:41,202 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-12-14 07:26:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:26:41,203 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-12-14 07:26:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:41,203 INFO L225 Difference]: With dead ends: 24 [2022-12-14 07:26:41,203 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 07:26:41,204 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-12-14 07:26:41,205 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:41,206 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.0s Time] [2022-12-14 07:26:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 07:26:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-12-14 07:26:41,209 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-12-14 07:26:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-12-14 07:26:41,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2022-12-14 07:26:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:41,210 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-12-14 07:26:41,210 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-12-14 07:26:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-12-14 07:26:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:26:41,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:41,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:26:41,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 867584416, now seen corresponding path program 1 times [2022-12-14 07:26:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316534647] [2022-12-14 07:26:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:41,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316534647] [2022-12-14 07:26:41,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316534647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:41,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605600168] [2022-12-14 07:26:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:41,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:41,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:26:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:41,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 07:26:41,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:41,983 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-12-14 07:26:42,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,028 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-12-14 07:26:42,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,121 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-12-14 07:26:42,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,227 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-12-14 07:26:42,239 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-12-14 07:26:42,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,373 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-12-14 07:26:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:42,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:42,459 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-12-14 07:26:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:42,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605600168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:42,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1262511444] [2022-12-14 07:26:42,660 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:42,660 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:42,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:42,667 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:42,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,758 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:42,758 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-12-14 07:26:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,781 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-12-14 07:26:42,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,807 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-12-14 07:26:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:42,859 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-12-14 07:26:43,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:43,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:43,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:43,060 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:26:43,060 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-12-14 07:26:43,220 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-12-14 07:26:43,251 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:43,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 21 treesize of output 29 [2022-12-14 07:26:43,308 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:43,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 26 treesize of output 54 [2022-12-14 07:26:43,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:43,370 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:43,370 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-12-14 07:26:43,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:43,393 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:26:43,394 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-12-14 07:26:43,455 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:43,456 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-12-14 07:26:43,488 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:43,488 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-12-14 07:26:43,512 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:43,870 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-12-14 07:26:43,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:43,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:43,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-12-14 07:26:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651379397] [2022-12-14 07:26:43,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:43,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 07:26:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 07:26:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-12-14 07:26:43,874 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-12-14 07:26:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:44,227 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-12-14 07:26:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 07:26:44,227 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-12-14 07:26:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:44,228 INFO L225 Difference]: With dead ends: 31 [2022-12-14 07:26:44,228 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 07:26:44,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:26:44,229 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:44,229 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.1s Time] [2022-12-14 07:26:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 07:26:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2022-12-14 07:26:44,234 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-12-14 07:26:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-12-14 07:26:44,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 11 [2022-12-14 07:26:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:44,234 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-12-14 07:26:44,234 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-12-14 07:26:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-12-14 07:26:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:26:44,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:44,235 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:44,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:26:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:44,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1750679399, now seen corresponding path program 2 times [2022-12-14 07:26:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412437779] [2022-12-14 07:26:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:44,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:44,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412437779] [2022-12-14 07:26:44,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412437779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:44,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427012451] [2022-12-14 07:26:44,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:26:44,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:44,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:44,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:26:44,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:26:44,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:26:44,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:26:44,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:44,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427012451] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [332638579] [2022-12-14 07:26:44,680 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:44,680 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:44,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:44,681 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:44,681 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,755 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:44,756 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-12-14 07:26:44,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,771 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-12-14 07:26:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,793 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-12-14 07:26:44,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,836 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-12-14 07:26:44,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:45,036 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:26:45,036 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-12-14 07:26:45,119 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-12-14 07:26:45,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:45,154 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:26:45,154 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-12-14 07:26:45,206 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:45,206 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-12-14 07:26:45,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:45,264 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:45,264 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-12-14 07:26:45,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:45,289 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:45,289 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-12-14 07:26:45,350 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:45,351 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-12-14 07:26:45,379 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:45,379 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-12-14 07:26:45,409 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:45,696 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-12-14 07:26:45,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:45,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:45,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-14 07:26:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215458381] [2022-12-14 07:26:45,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 07:26:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 07:26:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-12-14 07:26:45,698 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-12-14 07:26:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:45,745 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-12-14 07:26:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:26:45,745 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-12-14 07:26:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:45,745 INFO L225 Difference]: With dead ends: 51 [2022-12-14 07:26:45,746 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 07:26:45,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:26:45,746 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:45,747 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.0s Time] [2022-12-14 07:26:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 07:26:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2022-12-14 07:26:45,749 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-12-14 07:26:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-12-14 07:26:45,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-12-14 07:26:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:45,750 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-12-14 07:26:45,750 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-12-14 07:26:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-12-14 07:26:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:26:45,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:45,750 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:45,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:26:45,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:45,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2081436655, now seen corresponding path program 3 times [2022-12-14 07:26:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019011464] [2022-12-14 07:26:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:46,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:46,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019011464] [2022-12-14 07:26:46,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019011464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:46,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276238788] [2022-12-14 07:26:46,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:26:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:46,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:46,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:46,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:26:46,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:26:46,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:26:46,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:26:46,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:46,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276238788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:46,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [464206549] [2022-12-14 07:26:46,119 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:46,119 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:46,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:46,119 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:46,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:46,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,184 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:46,184 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-12-14 07:26:46,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,199 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-12-14 07:26:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,213 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-12-14 07:26:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,244 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-12-14 07:26:46,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:46,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:46,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:46,363 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:26:46,364 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-12-14 07:26:46,476 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-12-14 07:26:46,503 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:46,504 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-12-14 07:26:46,550 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:46,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 26 treesize of output 54 [2022-12-14 07:26:46,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:46,598 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:46,599 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-12-14 07:26:46,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:46,619 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:26:46,619 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-12-14 07:26:46,673 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:46,674 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-12-14 07:26:46,703 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:46,704 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-12-14 07:26:46,733 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:46,988 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-12-14 07:26:46,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:46,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-14 07:26:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693674568] [2022-12-14 07:26:46,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:46,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:26:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:26:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:26:46,990 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-12-14 07:26:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:47,059 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-12-14 07:26:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:26:47,060 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-12-14 07:26:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:47,060 INFO L225 Difference]: With dead ends: 32 [2022-12-14 07:26:47,060 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 07:26:47,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:26:47,061 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:47,062 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.0s Time] [2022-12-14 07:26:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 07:26:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2022-12-14 07:26:47,064 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-12-14 07:26:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-12-14 07:26:47,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2022-12-14 07:26:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:47,065 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-14 07:26:47,065 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-12-14 07:26:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-12-14 07:26:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 07:26:47,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:47,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:47,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 07:26:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:47,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -900606331, now seen corresponding path program 4 times [2022-12-14 07:26:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758945226] [2022-12-14 07:26:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:48,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758945226] [2022-12-14 07:26:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758945226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039931289] [2022-12-14 07:26:48,231 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:26:48,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:48,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:48,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:26:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:26:48,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:48,297 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-12-14 07:26:48,300 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-12-14 07:26:48,310 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-12-14 07:26:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,334 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-12-14 07:26:48,405 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-12-14 07:26:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:48,443 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-12-14 07:26:48,517 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-12-14 07:26:48,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,524 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-12-14 07:26:48,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,606 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-14 07:26:48,606 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-12-14 07:26:48,632 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-12-14 07:26:48,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:48,639 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-12-14 07:26:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:48,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:48,851 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-12-14 07:26:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039931289] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:49,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [160202999] [2022-12-14 07:26:49,531 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:49,531 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:49,531 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:49,531 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:49,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,590 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:49,591 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-12-14 07:26:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,605 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-12-14 07:26:49,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,619 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-12-14 07:26:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,660 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-12-14 07:26:49,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:49,771 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:26:49,771 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-12-14 07:26:49,837 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-12-14 07:26:49,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:49,872 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:49,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 21 treesize of output 29 [2022-12-14 07:26:49,918 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:49,918 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-12-14 07:26:49,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:49,959 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:49,959 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-12-14 07:26:49,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:49,975 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:26:49,976 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-12-14 07:26:50,015 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:50,016 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-12-14 07:26:50,039 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:50,039 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-12-14 07:26:50,050 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:50,412 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-12-14 07:26:50,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:50,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:50,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-12-14 07:26:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009995559] [2022-12-14 07:26:50,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:50,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 07:26:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 07:26:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 07:26:50,413 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-12-14 07:26:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:51,957 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-12-14 07:26:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 07:26:51,957 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-12-14 07:26:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:51,958 INFO L225 Difference]: With dead ends: 48 [2022-12-14 07:26:51,958 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 07:26:51,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 07:26:51,960 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:51,960 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.4s Time] [2022-12-14 07:26:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 07:26:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-12-14 07:26:51,968 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-12-14 07:26:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-12-14 07:26:51,968 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 14 [2022-12-14 07:26:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:51,968 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-12-14 07:26:51,969 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-12-14 07:26:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-12-14 07:26:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:26:51,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:51,969 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:51,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:26:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 07:26:52,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1631292812, now seen corresponding path program 5 times [2022-12-14 07:26:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806457919] [2022-12-14 07:26:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:26:52,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806457919] [2022-12-14 07:26:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806457919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188896879] [2022-12-14 07:26:52,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:26:52,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:52,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:52,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:52,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:26:52,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:26:52,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:26:52,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:26:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:26:52,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:26:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188896879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230445081] [2022-12-14 07:26:52,391 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:52,391 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:52,391 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:52,392 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:52,392 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:52,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,460 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:52,460 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-12-14 07:26:52,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,474 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-12-14 07:26:52,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,487 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-12-14 07:26:52,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,524 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-12-14 07:26:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:52,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:52,652 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:26:52,652 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-12-14 07:26:52,720 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-12-14 07:26:52,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:52,757 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:26:52,757 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-12-14 07:26:52,807 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:52,807 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-12-14 07:26:52,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:52,844 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:52,844 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-12-14 07:26:52,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:52,860 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:52,860 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-12-14 07:26:52,910 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:52,910 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-12-14 07:26:52,934 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:52,934 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-12-14 07:26:52,962 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:53,196 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-12-14 07:26:53,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:53,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:53,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-14 07:26:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233750411] [2022-12-14 07:26:53,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:53,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:26:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:26:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:26:53,197 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-12-14 07:26:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:53,336 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-12-14 07:26:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:26:53,337 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-12-14 07:26:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:53,337 INFO L225 Difference]: With dead ends: 61 [2022-12-14 07:26:53,337 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 07:26:53,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-12-14 07:26:53,338 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:53,338 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.1s Time] [2022-12-14 07:26:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 07:26:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2022-12-14 07:26:53,345 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-12-14 07:26:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-12-14 07:26:53,345 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2022-12-14 07:26:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:53,346 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-12-14 07:26:53,346 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-12-14 07:26:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-12-14 07:26:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:26:53,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:53,346 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:53,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:26:53,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 07:26:53,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1222709546, now seen corresponding path program 6 times [2022-12-14 07:26:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:53,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830964010] [2022-12-14 07:26:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:26:53,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830964010] [2022-12-14 07:26:53,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830964010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038021576] [2022-12-14 07:26:53,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:26:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:53,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:53,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:26:53,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:26:53,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:26:53,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:26:53,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:26:53,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:26:53,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038021576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:53,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447774434] [2022-12-14 07:26:53,814 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:26:53,814 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:53,814 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:53,814 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:53,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:53,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,869 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-12-14 07:26:53,869 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-12-14 07:26:53,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,890 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:26:53,890 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-12-14 07:26:53,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,949 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:53,949 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-12-14 07:26:53,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:53,978 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-12-14 07:26:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:54,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:54,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:54,088 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:26:54,089 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-12-14 07:26:54,198 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-12-14 07:26:54,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:54,220 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:26:54,220 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-12-14 07:26:54,265 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:54,265 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-12-14 07:26:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:54,308 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:54,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 25 treesize of output 32 [2022-12-14 07:26:54,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:54,331 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:54,331 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-12-14 07:26:54,381 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:54,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 36 treesize of output 58 [2022-12-14 07:26:54,403 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:54,403 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-12-14 07:26:54,431 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:54,777 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-12-14 07:26:54,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:54,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:54,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2022-12-14 07:26:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015370232] [2022-12-14 07:26:54,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:54,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 07:26:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 07:26:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:26:54,779 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-12-14 07:26:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:54,851 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-12-14 07:26:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:26:54,851 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-12-14 07:26:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:54,852 INFO L225 Difference]: With dead ends: 59 [2022-12-14 07:26:54,852 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 07:26:54,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:26:54,853 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:54,853 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.0s Time] [2022-12-14 07:26:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 07:26:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-12-14 07:26:54,859 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-12-14 07:26:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-14 07:26:54,859 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-12-14 07:26:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:54,859 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-14 07:26:54,859 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-12-14 07:26:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-14 07:26:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:26:54,860 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:54,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:54,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:26:55,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:55,061 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:26:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 702654167, now seen corresponding path program 1 times [2022-12-14 07:26:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:55,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301473737] [2022-12-14 07:26:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:55,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:56,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:56,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301473737] [2022-12-14 07:26:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301473737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:56,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829770891] [2022-12-14 07:26:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:56,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:56,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:56,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:26:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:56,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 07:26:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:56,091 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-12-14 07:26:56,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,115 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-12-14 07:26:56,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,164 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-12-14 07:26:56,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,173 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-12-14 07:26:56,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,195 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-12-14 07:26:56,227 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-12-14 07:26:56,230 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-12-14 07:26:56,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,234 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-12-14 07:26:56,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,277 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-12-14 07:26:56,325 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-12-14 07:26:56,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:56,327 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-12-14 07:26:56,331 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-12-14 07:26:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:26:56,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:57,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,278 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-12-14 07:26:57,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,281 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-12-14 07:26:57,285 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-12-14 07:26:57,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,383 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-12-14 07:26:57,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,391 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-12-14 07:26:57,394 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-12-14 07:26:57,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,411 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-12-14 07:26:57,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:57,419 INFO L321 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2022-12-14 07:26:57,419 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-12-14 07:26:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 07:26:57,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829770891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:26:57,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1161018584] [2022-12-14 07:26:57,451 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:26:57,451 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:26:57,451 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:26:57,451 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:26:57,451 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:26:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,477 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:26:57,477 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-12-14 07:26:57,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,536 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:26:57,537 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-12-14 07:26:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,550 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-12-14 07:26:57,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,573 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-12-14 07:26:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:57,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:57,692 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:26:57,693 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-12-14 07:26:57,770 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-12-14 07:26:57,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:57,811 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:57,811 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-12-14 07:26:57,863 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:26:57,863 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-12-14 07:26:57,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:57,910 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:26:57,910 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-12-14 07:26:57,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:26:57,930 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:26:57,930 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-12-14 07:26:57,976 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:26:57,977 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-12-14 07:26:58,003 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:26:58,003 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-12-14 07:26:58,083 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:26:58,728 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-12-14 07:26:58,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:26:58,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:26:58,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 37 [2022-12-14 07:26:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569251935] [2022-12-14 07:26:58,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:26:58,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 07:26:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:26:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 07:26:58,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1539, Unknown=4, NotChecked=80, Total=1806 [2022-12-14 07:26:58,731 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-12-14 07:27:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:27:00,789 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-12-14 07:27:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 07:27:00,789 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-12-14 07:27:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:27:00,789 INFO L225 Difference]: With dead ends: 51 [2022-12-14 07:27:00,789 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 07:27:00,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=472, Invalid=4084, Unknown=4, NotChecked=132, Total=4692 [2022-12-14 07:27:00,791 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:27:00,791 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.4s Time] [2022-12-14 07:27:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 07:27:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-12-14 07:27:00,798 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-12-14 07:27:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-12-14 07:27:00,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-12-14 07:27:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:27:00,798 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-12-14 07:27:00,799 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-12-14 07:27:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-12-14 07:27:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:27:00,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:27:00,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:27:00,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:27:00,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:01,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:27:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:27:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1191869440, now seen corresponding path program 7 times [2022-12-14 07:27:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:27:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689633671] [2022-12-14 07:27:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:27:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:27:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:02,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:27:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689633671] [2022-12-14 07:27:02,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689633671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:27:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212253170] [2022-12-14 07:27:02,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:27:02,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:02,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:27:02,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:27:02,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:27:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:02,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-14 07:27:02,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:27:02,360 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-12-14 07:27:02,364 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-12-14 07:27:02,391 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-12-14 07:27:02,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,429 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-12-14 07:27:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,478 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-12-14 07:27:02,547 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-12-14 07:27:02,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,571 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-12-14 07:27:02,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:02,622 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-12-14 07:27:02,759 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-12-14 07:27:02,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,767 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-12-14 07:27:02,845 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-12-14 07:27:02,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:02,874 INFO L321 Elim1Store]: treesize reduction 43, result has 49.4 percent of original size [2022-12-14 07:27:02,874 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-12-14 07:27:03,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:03,061 INFO L321 Elim1Store]: treesize reduction 146, result has 43.2 percent of original size [2022-12-14 07:27:03,061 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-12-14 07:27:03,107 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-12-14 07:27:03,125 INFO L321 Elim1Store]: treesize reduction 21, result has 40.0 percent of original size [2022-12-14 07:27:03,125 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-12-14 07:27:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:03,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:27:03,424 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-12-14 07:27:03,541 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-12-14 07:27:05,571 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-12-14 07:27:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 07:27:15,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212253170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:27:15,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777794054] [2022-12-14 07:27:15,156 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:27:15,156 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:27:15,156 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:27:15,156 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:27:15,156 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:27:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,226 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:27:15,227 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-12-14 07:27:15,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,237 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-12-14 07:27:15,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,248 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-12-14 07:27:15,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,282 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-12-14 07:27:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:15,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:15,404 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:27:15,405 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-12-14 07:27:15,466 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-12-14 07:27:15,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:15,512 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:27:15,512 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-12-14 07:27:15,571 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:27:15,572 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-12-14 07:27:15,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:15,618 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:15,619 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-12-14 07:27:15,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:15,639 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:27:15,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 35 treesize of output 22 [2022-12-14 07:27:15,693 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:27:15,693 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-12-14 07:27:15,728 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:27:15,729 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-12-14 07:27:15,756 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:27:16,286 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-12-14 07:27:16,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:27:16,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:27:16,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-12-14 07:27:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389037964] [2022-12-14 07:27:16,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:27:16,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 07:27:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:27:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 07:27:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1793, Unknown=1, NotChecked=86, Total=2070 [2022-12-14 07:27:16,288 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-12-14 07:27:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:27:37,504 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-12-14 07:27:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 07:27:37,505 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-12-14 07:27:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:27:37,506 INFO L225 Difference]: With dead ends: 74 [2022-12-14 07:27:37,506 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 07:27:37,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=428, Invalid=3865, Unknown=1, NotChecked=128, Total=4422 [2022-12-14 07:27:37,507 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:27:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 487 Invalid, 0 Unknown, 43 Unchecked, 2.4s Time] [2022-12-14 07:27:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 07:27:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-12-14 07:27:37,519 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-12-14 07:27:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-12-14 07:27:37,520 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2022-12-14 07:27:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:27:37,520 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-12-14 07:27:37,520 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-12-14 07:27:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-12-14 07:27:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:27:37,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:27:37,520 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:27:37,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 07:27:37,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 07:27:37,722 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:27:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:27:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash 205170097, now seen corresponding path program 8 times [2022-12-14 07:27:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:27:37,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726022775] [2022-12-14 07:27:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:27:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:27:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:27:37,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:27:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726022775] [2022-12-14 07:27:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726022775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:27:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026614144] [2022-12-14 07:27:37,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:27:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:27:37,841 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:27:37,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:27:37,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:27:37,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:27:37,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 07:27:37,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:27:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:27:37,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:27:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:27:38,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026614144] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:27:38,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002084400] [2022-12-14 07:27:38,026 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:27:38,026 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:27:38,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:27:38,026 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:27:38,026 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:27:38,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,093 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-12-14 07:27:38,094 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-12-14 07:27:38,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,118 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:27:38,119 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-12-14 07:27:38,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,176 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:27:38,177 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-12-14 07:27:38,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,212 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-12-14 07:27:38,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:38,325 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:27:38,325 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-12-14 07:27:38,391 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-12-14 07:27:38,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:38,430 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:38,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 21 treesize of output 29 [2022-12-14 07:27:38,468 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:27:38,469 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-12-14 07:27:38,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:38,506 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:38,506 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-12-14 07:27:38,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:38,523 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:27:38,523 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-12-14 07:27:38,563 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:27:38,564 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-12-14 07:27:38,590 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:27:38,591 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-12-14 07:27:38,601 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:27:38,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2278#(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-12-14 07:27:38,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:27:38,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:27:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-14 07:27:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153245526] [2022-12-14 07:27:38,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:27:38,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 07:27:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:27:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 07:27:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:27:38,844 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-12-14 07:27:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:27:39,077 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2022-12-14 07:27:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 07:27:39,077 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-12-14 07:27:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:27:39,077 INFO L225 Difference]: With dead ends: 97 [2022-12-14 07:27:39,077 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 07:27:39,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-12-14 07:27:39,078 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:27:39,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 96 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:27:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 07:27:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2022-12-14 07:27:39,099 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-12-14 07:27:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-12-14 07:27:39,100 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 18 [2022-12-14 07:27:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:27:39,100 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-12-14 07:27:39,100 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-12-14 07:27:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-12-14 07:27:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:27:39,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:27:39,101 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:27:39,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 07:27:39,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 07:27:39,302 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:27:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:27:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1567448571, now seen corresponding path program 9 times [2022-12-14 07:27:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:27:39,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32661036] [2022-12-14 07:27:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:27:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:27:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:27:39,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:27:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32661036] [2022-12-14 07:27:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32661036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:27:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785725087] [2022-12-14 07:27:39,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:27:39,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:39,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:27:39,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:27:39,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 07:27:39,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:27:39,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:27:39,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:27:39,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:27:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:27:39,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:27:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:27:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785725087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:27:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [48886621] [2022-12-14 07:27:39,715 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:27:39,715 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:27:39,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:27:39,715 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:27:39,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:27:39,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,740 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:27:39,741 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-12-14 07:27:39,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,811 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-12-14 07:27:39,811 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-12-14 07:27:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,878 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:27:39,879 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-12-14 07:27:39,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,909 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-12-14 07:27:39,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:39,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:39,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:40,035 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:27:40,035 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-12-14 07:27:40,105 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-12-14 07:27:40,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:40,145 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:40,146 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-12-14 07:27:40,198 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:27:40,199 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-12-14 07:27:40,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:40,241 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:40,241 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-12-14 07:27:40,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:40,259 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:27:40,259 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-12-14 07:27:40,305 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:27:40,305 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-12-14 07:27:40,328 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:27:40,328 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-12-14 07:27:40,353 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:27:40,622 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2674#(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-12-14 07:27:40,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:27:40,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:27:40,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 27 [2022-12-14 07:27:40,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941843997] [2022-12-14 07:27:40,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:27:40,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 07:27:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:27:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 07:27:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2022-12-14 07:27:40,624 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-12-14 07:27:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:27:41,092 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-12-14 07:27:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 07:27:41,092 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-12-14 07:27:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:27:41,093 INFO L225 Difference]: With dead ends: 124 [2022-12-14 07:27:41,093 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 07:27:41,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=2266, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 07:27:41,094 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 193 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:27:41,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 239 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:27:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 07:27:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-12-14 07:27:41,108 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-12-14 07:27:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-12-14 07:27:41,109 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 20 [2022-12-14 07:27:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:27:41,109 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-12-14 07:27:41,109 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-12-14 07:27:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-12-14 07:27:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:27:41,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:27:41,109 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:27:41,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 07:27:41,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:41,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:27:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:27:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -103922907, now seen corresponding path program 10 times [2022-12-14 07:27:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:27:41,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959139867] [2022-12-14 07:27:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:27:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:27:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:42,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:27:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959139867] [2022-12-14 07:27:42,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959139867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:27:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446468189] [2022-12-14 07:27:42,902 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:27:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:27:42,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:27:42,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 07:27:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:42,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 07:27:42,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:27:42,997 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-12-14 07:27:43,001 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-12-14 07:27:43,023 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-12-14 07:27:43,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,054 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-12-14 07:27:43,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,105 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-12-14 07:27:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,155 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-12-14 07:27:43,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,239 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-12-14 07:27:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,273 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-12-14 07:27:43,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,338 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-12-14 07:27:43,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,420 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-12-14 07:27:43,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,584 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-12-14 07:27:43,603 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-12-14 07:27:43,607 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-12-14 07:27:43,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,690 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-12-14 07:27:43,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,805 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-12-14 07:27:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,814 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-12-14 07:27:43,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:43,924 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-12-14 07:27:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:43,932 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-12-14 07:27:43,944 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-12-14 07:27:43,946 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-12-14 07:27:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:44,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:27:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:47,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446468189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:27:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702499270] [2022-12-14 07:27:47,030 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:27:47,030 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:27:47,030 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:27:47,030 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:27:47,030 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:27:47,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,088 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:27:47,088 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-12-14 07:27:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,100 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-12-14 07:27:47,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,114 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-12-14 07:27:47,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,136 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-12-14 07:27:47,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:47,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:47,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:47,250 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:27:47,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-12-14 07:27:47,318 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-12-14 07:27:47,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:47,343 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:27:47,343 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-12-14 07:27:47,384 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:27:47,384 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-12-14 07:27:47,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:47,425 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:47,425 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-12-14 07:27:47,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:47,443 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:27:47,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 26 treesize of output 33 [2022-12-14 07:27:47,492 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:27:47,492 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-12-14 07:27:47,515 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:27:47,515 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-12-14 07:27:47,548 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:27:48,814 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3179#(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-12-14 07:27:48,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:27:48,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:27:48,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2022-12-14 07:27:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170846648] [2022-12-14 07:27:48,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:27:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 07:27:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:27:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 07:27:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2741, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 07:27:48,816 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-12-14 07:27:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:27:55,299 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-12-14 07:27:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 07:27:55,299 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-12-14 07:27:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:27:55,299 INFO L225 Difference]: With dead ends: 98 [2022-12-14 07:27:55,299 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 07:27:55,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=489, Invalid=5061, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 07:27:55,300 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 98 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:27:55,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 176 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 07:27:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 07:27:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2022-12-14 07:27:55,315 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-12-14 07:27:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-12-14 07:27:55,315 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 20 [2022-12-14 07:27:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:27:55,316 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-12-14 07:27:55,316 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-12-14 07:27:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-12-14 07:27:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 07:27:55,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:27:55,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:27:55,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 07:27:55,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 07:27:55,518 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:27:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:27:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1406371200, now seen corresponding path program 2 times [2022-12-14 07:27:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:27:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541059823] [2022-12-14 07:27:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:27:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:27:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:27:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:56,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:27:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541059823] [2022-12-14 07:27:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541059823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:27:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794973898] [2022-12-14 07:27:56,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:27:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:27:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:27:56,446 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:27:56,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 07:27:56,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:27:56,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:27:56,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 07:27:56,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:27:56,564 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-12-14 07:27:56,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,590 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-12-14 07:27:56,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,627 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-12-14 07:27:56,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,712 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-12-14 07:27:56,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,750 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-12-14 07:27:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,764 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-12-14 07:27:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:27:56,795 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-12-14 07:27:56,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,823 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-12-14 07:27:56,826 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-12-14 07:27:56,834 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-12-14 07:27:56,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,897 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-12-14 07:27:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:56,919 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-12-14 07:27:56,924 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-12-14 07:27:56,931 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-12-14 07:27:56,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:57,026 INFO L321 Elim1Store]: treesize reduction 72, result has 52.9 percent of original size [2022-12-14 07:27:57,026 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-12-14 07:27:57,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:27:57,258 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-12-14 07:27:57,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:27:57,484 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-12-14 07:27:57,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:27:57,498 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-12-14 07:27:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:27:58,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:28:25,416 WARN L233 SmtUtils]: Spent 11.85s 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-12-14 07:28:25,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:25,451 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-12-14 07:28:25,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:25,476 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-12-14 07:28:25,505 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-12-14 07:28:34,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:34,412 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-12-14 07:28:34,418 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-12-14 07:28:34,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:34,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:34,570 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-12-14 07:28:34,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:34,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:34,631 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-12-14 07:28:35,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:28:35,435 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-12-14 07:28:35,442 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-12-14 07:28:35,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:35,559 INFO L321 Elim1Store]: treesize reduction 84, result has 35.9 percent of original size [2022-12-14 07:28:35,560 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-12-14 07:28:35,665 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-12-14 07:28:35,665 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-12-14 07:28:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-12-14 07:28:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794973898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:28:36,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176952697] [2022-12-14 07:28:36,250 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:28:36,250 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:28:36,250 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:28:36,250 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:28:36,251 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:28:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,324 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-12-14 07:28:36,325 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-12-14 07:28:36,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,352 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:28:36,352 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-12-14 07:28:36,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,429 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:28:36,430 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-12-14 07:28:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,458 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-12-14 07:28:36,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:28:36,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:36,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:36,587 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:28:36,587 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-12-14 07:28:36,652 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-12-14 07:28:36,684 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:28:36,684 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-12-14 07:28:36,735 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:28:36,735 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-12-14 07:28:36,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:36,782 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:28:36,782 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-12-14 07:28:36,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:28:36,806 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:28:36,806 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-12-14 07:28:36,860 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:28:36,860 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-12-14 07:28:36,893 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:28:36,893 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-12-14 07:28:36,950 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:28:39,095 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3663#(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-12-14 07:28:39,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:28:39,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:28:39,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 19] total 51 [2022-12-14 07:28:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893981470] [2022-12-14 07:28:39,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:28:39,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 07:28:39,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:28:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 07:28:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2647, Unknown=11, NotChecked=106, Total=3080 [2022-12-14 07:28:39,097 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-12-14 07:29:00,953 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 200 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:29:03,838 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-12-14 07:29:05,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse27 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse45 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse18 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (= .cse18 c_~N~0)) (.cse26 (select .cse14 .cse45)) (.cse44 (store .cse14 .cse27 1)) (.cse28 (select .cse14 0))) (let ((.cse10 (= .cse28 1)) (.cse17 (select .cse14 .cse27)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse45 1))) (.cse25 (= .cse26 0)) (.cse29 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse15 (= .cse27 8)) (.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (not .cse13))) (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 ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse6 (store (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse1 v_ArrVal_794))) (let ((.cse0 (let ((.cse7 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse6 .cse7 (+ (- 1) (select .cse6 .cse7))))) (.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (select .cse0 .cse1) 0)) (< .cse2 .cse3) (= (select .cse0 .cse4) 0) (< (+ v_subst_1 1) .cse3) (not (< v_subst_1 .cse3)) (not (< 2 .cse3)) (not (< |c_ULTIMATE.start_main_~i~0#1| .cse3))))))) (or (<= (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 4)) (and .cse10 .cse11) (let ((.cse12 (select .cse14 .cse4))) (and (<= .cse12 1) (<= 1 .cse12) .cse13))) (or (not .cse15) (let ((.cse16 (= (+ .cse18 .cse17) c_~N~0))) (and (or .cse10 .cse16) (or (= .cse17 1) (not .cse16))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse20 (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse21 (let ((.cse23 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse1 (+ (select .cse23 .cse1) 1))))) (let ((.cse19 (let ((.cse22 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse21 .cse22 (+ (select .cse21 .cse22) 1))))) (or (not (= (select .cse19 .cse1) 0)) (= (select .cse19 .cse4) 0) (< .cse2 (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (< v_subst_2 .cse2) (< .cse2 v_subst_2))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (not (= .cse17 0)) .cse25 (not (< .cse2 c_~N~0))) (or (and (<= 1 .cse26) (<= .cse26 1) (= .cse27 4) .cse13) (and (not (= .cse28 0)) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) .cse11)) (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 ((.cse34 (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse32 (store (store (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse1 v_ArrVal_794))) (let ((.cse30 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (let ((.cse33 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse32 .cse33 (+ (- 1) (select .cse32 .cse33)))))) (or (< .cse29 .cse30) (not (= (select .cse31 .cse1) 0)) (not (< .cse2 .cse30)) (< (+ v_subst_1 1) .cse30) (not (< v_subst_1 .cse30)) (not (< 2 .cse30)) (= (select .cse31 .cse4) 0)))))) (or (not .cse25) (not (< .cse29 c_~N~0)) (= (select .cse14 (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) (or (and (<= 3 c_~N~0) (<= .cse27 8)) .cse15) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< |c_ULTIMATE.start_main_~i~0#1| 2) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse36 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse37 (let ((.cse39 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse1 (+ (select .cse39 .cse1) 1))))) (let ((.cse35 (let ((.cse38 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse37 .cse38 (+ (select .cse37 .cse38) 1))))) (or (= (select .cse35 .cse4) 0) (< v_subst_2 |c_ULTIMATE.start_main_~i~0#1|) (not (= (select .cse35 .cse1) 0)) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (< |c_ULTIMATE.start_main_~i~0#1| (select (select (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (or (not (< 2 c_~N~0)) (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse40 (let ((.cse41 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse14 .cse41 (+ (select .cse14 .cse41) 1))))) (or (not (= (select .cse40 .cse1) 0)) (= (select .cse40 .cse4) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0))))) .cse13) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse42 (let ((.cse43 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse14 .cse43 (+ (- 1) (select .cse14 .cse43)))))) (or (not (= (select .cse42 .cse1) 0)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= (select .cse42 .cse4) 0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0))))) .cse11)))))))) is different from false [2022-12-14 07:29:18,335 WARN L233 SmtUtils]: Spent 11.49s on a formula simplification. DAG size of input: 190 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:29:20,743 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-12-14 07:29:50,181 WARN L233 SmtUtils]: Spent 24.03s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:17,502 WARN L233 SmtUtils]: Spent 24.84s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:19,790 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-12-14 07:30:32,562 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:32,597 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse39 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse38 (store .cse36 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse37 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse38 .cse37 1))) (.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38)) (.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)) (.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (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) (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 ((.cse16 (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse17 (store (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse13 (let ((.cse18 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse17 .cse18 (+ (- 1) (select .cse17 .cse18))))) (.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= (select .cse13 .cse4) 0)) (< .cse14 .cse15) (= (select .cse13 .cse3) 0) (< (+ v_subst_1 1) .cse15) (not (< v_subst_1 .cse15)) (not (< 2 .cse15)) (not (< |c_ULTIMATE.start_main_~i~0#1| .cse15))))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse21 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse22 (let ((.cse24 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse24 .cse4) 1))))) (let ((.cse20 (let ((.cse23 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse22 .cse23 (+ (select .cse22 .cse23) 1))))) (or (not (= (select .cse20 .cse4) 0)) (= (select .cse20 .cse3) 0) (< .cse14 (select (select (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (< v_subst_2 .cse14) (< .cse14 v_subst_2))))))) (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 ((.cse30 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_36))) (let ((.cse28 (store (store (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 v_ArrVal_794))) (let ((.cse26 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (let ((.cse29 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse28 .cse29 (+ (- 1) (select .cse28 .cse29)))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse26) (not (= (select .cse27 .cse4) 0)) (not (< .cse14 .cse26)) (< (+ v_subst_1 1) .cse26) (not (< v_subst_1 .cse26)) (not (< 2 .cse26)) (= (select .cse27 .cse3) 0)))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 2) (forall ((v_arrayElimArr_35 (Array Int Int)) (v_ArrVal_792 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_subst_2 Int)) (let ((.cse32 (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_35))) (let ((.cse33 (let ((.cse35 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_792) .cse4 (+ (select .cse35 .cse4) 1))))) (let ((.cse31 (let ((.cse34 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse33 .cse34 (+ (select .cse33 .cse34) 1))))) (or (= (select .cse31 .cse3) 0) (< v_subst_2 |c_ULTIMATE.start_main_~i~0#1|) (not (= (select .cse31 .cse4) 0)) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (< |c_ULTIMATE.start_main_~i~0#1| (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (or .cse11 .cse12 (= (select .cse36 .cse3) 0) (not (= (select .cse36 .cse4) 0))) (or (= (select .cse36 .cse37) 0) (not (< .cse14 c_~N~0)) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)))))) is different from false [2022-12-14 07:30:39,267 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:30:39,277 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-12-14 07:30:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 07:30:39,279 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-12-14 07:30:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:30:39,279 INFO L225 Difference]: With dead ends: 72 [2022-12-14 07:30:39,279 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 07:30:39,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 22 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2802 ImplicationChecksByTransitivity, 146.9s TimeCoverageRelationStatistics Valid=886, Invalid=6749, Unknown=33, NotChecked=522, Total=8190 [2022-12-14 07:30:39,281 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 120 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:30:39,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 515 Invalid, 13 Unknown, 44 Unchecked, 11.3s Time] [2022-12-14 07:30:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 07:30:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-12-14 07:30:39,301 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-12-14 07:30:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-12-14 07:30:39,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 23 [2022-12-14 07:30:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:30:39,302 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-12-14 07:30:39,302 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-12-14 07:30:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-12-14 07:30:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 07:30:39,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:30:39,302 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:30:39,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 07:30:39,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 07:30:39,504 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:30:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:30:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1713112672, now seen corresponding path program 11 times [2022-12-14 07:30:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:30:39,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25237174] [2022-12-14 07:30:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:30:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:30:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:30:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:30:42,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:30:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25237174] [2022-12-14 07:30:42,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25237174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:30:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581046030] [2022-12-14 07:30:42,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:30:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:30:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:30:42,169 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:30:42,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 07:30:42,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:30:42,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:30:42,443 WARN L261 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 122 conjunts are in the unsatisfiable core [2022-12-14 07:30:42,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:30:42,462 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-12-14 07:30:42,469 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-12-14 07:30:42,516 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-12-14 07:30:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,576 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-12-14 07:30:42,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,665 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-12-14 07:30:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,787 INFO L321 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-12-14 07:30:42,788 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-12-14 07:30:42,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:42,931 INFO L321 Elim1Store]: treesize reduction 94, result has 21.7 percent of original size [2022-12-14 07:30:42,931 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-12-14 07:30:43,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:30:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,239 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-14 07:30:43,240 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-12-14 07:30:43,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:30:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,417 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-12-14 07:30:43,417 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-12-14 07:30:43,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,589 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-12-14 07:30:43,589 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-12-14 07:30:43,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,775 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-12-14 07:30:43,775 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-12-14 07:30:43,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:43,996 INFO L321 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2022-12-14 07:30:43,996 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-12-14 07:30:44,401 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-12-14 07:30:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:44,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:44,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:44,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:30:44,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:44,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:30:44,454 INFO L321 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-12-14 07:30:44,454 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-12-14 07:30:44,495 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-12-14 07:30:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:30:45,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,328 INFO L321 Elim1Store]: treesize reduction 134, result has 44.9 percent of original size [2022-12-14 07:30:45,328 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 254 treesize of output 327 [2022-12-14 07:30:45,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,346 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 161 treesize of output 151 [2022-12-14 07:30:45,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:45,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:30:45,412 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 151 treesize of output 189 [2022-12-14 07:30:46,664 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 198 treesize of output 171 [2022-12-14 07:30:46,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:46,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:46,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:46,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:30:46,711 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 159 treesize of output 195 [2022-12-14 07:30:47,069 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 189 treesize of output 185 [2022-12-14 07:30:47,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:47,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:47,147 INFO L321 Elim1Store]: treesize reduction 77, result has 42.1 percent of original size [2022-12-14 07:30:47,148 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 144 treesize of output 187 [2022-12-14 07:30:47,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:47,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:47,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:30:47,213 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 116 treesize of output 142 [2022-12-14 07:30:47,934 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 95 treesize of output 74 [2022-12-14 07:30:48,151 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 122 treesize of output 122 [2022-12-14 07:30:48,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,204 INFO L321 Elim1Store]: treesize reduction 77, result has 31.9 percent of original size [2022-12-14 07:30:48,205 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 81 treesize of output 112 [2022-12-14 07:30:48,365 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 82 treesize of output 66 [2022-12-14 07:30:48,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,566 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 117 treesize of output 117 [2022-12-14 07:30:48,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,598 INFO L321 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-12-14 07:30:48,598 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 78 treesize of output 98 [2022-12-14 07:30:48,696 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 45 treesize of output 29 [2022-12-14 07:30:48,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:30:48,785 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-12-14 07:30:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:30:49,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:30:49,443 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-12-14 07:30:49,658 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-12-14 07:30:49,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:30:49,871 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-12-14 07:30:49,877 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-12-14 07:31:42,976 WARN L233 SmtUtils]: Spent 51.63s 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-12-14 07:32:31,993 WARN L233 SmtUtils]: Spent 6.85s 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-12-14 07:33:10,143 WARN L233 SmtUtils]: Spent 8.85s 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-12-14 07:33:47,090 WARN L233 SmtUtils]: Spent 10.34s 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-12-14 07:34:16,830 WARN L233 SmtUtils]: Spent 11.80s 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-12-14 07:34:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:34:16,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581046030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:34:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057149476] [2022-12-14 07:34:16,902 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:34:16,902 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:34:16,903 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:34:16,903 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:34:16,903 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:34:16,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:16,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,274 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:34:17,274 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-12-14 07:34:17,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,300 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-12-14 07:34:17,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,341 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-12-14 07:34:17,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,392 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-12-14 07:34:17,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:34:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:34:17,735 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:34:17,735 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-12-14 07:34:17,816 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-12-14 07:34:17,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:34:17,980 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:34:17,980 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-12-14 07:34:18,216 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:34:18,216 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-12-14 07:34:18,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:34:18,376 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:34:18,377 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-12-14 07:34:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:34:18,446 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:34:18,446 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-12-14 07:34:18,662 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:34:18,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 36 treesize of output 58 [2022-12-14 07:34:18,778 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:34:18,778 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-12-14 07:34:18,806 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:34:27,197 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4128#(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-12-14 07:34:27,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:34:27,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:34:27,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2022-12-14 07:34:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783496257] [2022-12-14 07:34:27,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:34:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-14 07:34:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:34:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-14 07:34:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=3866, Unknown=18, NotChecked=0, Total=4290 [2022-12-14 07:34:27,199 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-12-14 07:34:36,139 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-12-14 07:34:43,249 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-12-14 07:34:48,007 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-12-14 07:35:03,344 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-12-14 07:35:05,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:35:13,789 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-12-14 07:35:15,798 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-12-14 07:35:17,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:35:19,521 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-12-14 07:35:21,761 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-12-14 07:35:24,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:35:26,415 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-12-14 07:35:28,533 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-12-14 07:35:37,117 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-12-14 07:35:40,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:35:57,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:36:02,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:36:04,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:36:18,766 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-12-14 07:36:26,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:36:49,914 WARN L233 SmtUtils]: Spent 12.33s 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-12-14 07:36:51,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:36:52,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:36:56,434 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse182 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse184 (+ .cse182 |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 .cse184))) (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|)) (.cse183 (+ .cse182 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse27 (store .cse17 .cse184 1)) (.cse54 (select .cse6 .cse183))) (let ((.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|)) (.cse75 (store .cse27 .cse183 1)) (.cse116 (+ .cse182 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.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 (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 ((.cse97 (* |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 (+ .cse97 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= 1 (select .cse17 (+ .cse97 |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 ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse101 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse100 (select .cse17 (+ .cse101 |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 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse101 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse100))))))) (store .cse98 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse99 (select .cse98 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse99 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse99 .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 ((.cse103 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse102 (select .cse17 (+ .cse103 |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 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse103 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse102))))) |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 ((.cse105 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse104 (select .cse17 (+ .cse105 |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 .cse104))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse105 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse104)))) (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 ((.cse106 (select .cse57 .cse116))) (let ((.cse109 (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 .cse106))) |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 ((.cse108 (* 4 v_subst_3))) (let ((.cse107 (select .cse109 (+ .cse108 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse54 .cse4 .cse106 .cse107 (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 .cse106 .cse107))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse108 |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 ((.cse110 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse113 (* 4 v_subst_4))) (let ((.cse112 (select .cse109 (+ .cse113 |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 .cse106 .cse112))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse113 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse1 .cse54 .cse4 .cse106 .cse112))))))) (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|))) .cse11 (+ (select .cse111 .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 ((.cse115 (* 4 v_subst_5))) (let ((.cse114 (select .cse109 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse115)))) (+ .cse1 .cse114 (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 .cse114 .cse54 .cse4 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse115)) .cse54 .cse4 .cse106)))) (not (< (+ v_subst_5 1) c_~N~0))))))) .cse16) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse0 (let ((.cse128 (store .cse75 .cse116 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 ((.cse117 (let ((.cse127 (let ((.cse129 (* 4 v_subst_7))) (store (store .cse128 (+ .cse129 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse129 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse127))) (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse121 (select .cse127 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse122 (select .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse124 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse125 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse126 (* 4 v_subst_4))) (let ((.cse123 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122 .cse124 .cse125))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse126 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse121 (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse121 .cse122 .cse123 .cse124 .cse125))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse126 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse122 .cse123 .cse124 .cse125)))))))))))) (store .cse117 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse118 (select .cse117 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse118 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse118 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse118 .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 (< (+ 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 ((.cse138 (let ((.cse139 (* 4 v_subst_8))) (store (store .cse128 (+ .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse139 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse135 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse138))) (let ((.cse136 (select .cse135 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse133 (select .cse138 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse134 (select .cse136 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse131 (select (select (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse136 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse133 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse130 (select (select (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse136 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse131 .cse133 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse137 (* 4 v_subst_5))) (let ((.cse132 (select (select (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse136 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse130 .cse131 .cse133 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse137)))) (+ .cse130 .cse131 .cse132 .cse133 .cse134 (select (select (store .cse135 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse136 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse130 .cse131 .cse132 .cse133 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse137))))))))))) (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 ((.cse148 (let ((.cse149 (* 4 v_subst_6))) (store (store .cse128 (+ .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 ((.cse142 (select .cse141 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse143 (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| (+ .cse142 .cse143))) |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| (+ .cse142 .cse143 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse147 (* 4 v_subst_3))) (let ((.cse146 (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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse147 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse142 .cse143 (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)) .cse144 .cse145 .cse146)))))))))) |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)) .cse16) (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 ((.cse158 (let ((.cse159 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse159 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse159 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse158))) (let ((.cse151 (select .cse150 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse152 (select .cse151 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse155 (select .cse158 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse154 (select (select (store .cse150 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse151 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse155))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse153 (select (select (store .cse150 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse151 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse154 .cse155))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse157 (* 4 v_subst_5))) (let ((.cse156 (select (select (store .cse150 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse151 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse153 .cse154 .cse155))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse157)))) (+ (select (select (store .cse150 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse151 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse152 .cse153 .cse154 .cse155 .cse156))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse157)) .cse152 .cse153 .cse154 .cse155 .cse156))))))))) (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 ((.cse168 (let ((.cse169 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse169 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse169 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse160 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse168))) (store .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse161 (select .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse162 (select .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse165 (select .cse168 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse164 (select (select (store .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse162 .cse165))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse163 (select (select (store .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse162 .cse164 .cse165))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse167 (* 4 v_subst_3))) (let ((.cse166 (select (select (store .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse162 .cse163 .cse164 .cse165))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse167 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse162 .cse163 .cse164 .cse165 .cse166 (select (select (store .cse160 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse161 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse162 .cse163 .cse164 .cse165 .cse166))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse167 |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 ((.cse170 (let ((.cse180 (let ((.cse181 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store .cse17 (+ .cse181 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse181 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse172 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse180))) (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse173 (select .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse175 (select .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse178 (select .cse180 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse177 (select (select (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse175 .cse178))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse176 (select (select (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse175 .cse177 .cse178))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse179 (* 4 v_subst_4))) (let ((.cse174 (select (select (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse175 .cse176 .cse177 .cse178))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse179 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse174 .cse175 .cse176 .cse177 (select (select (store .cse172 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse173 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse174 .cse175 .cse176 .cse177 .cse178))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse179 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse178)))))))))))) (store .cse170 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse171 (select .cse170 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse171 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse171 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse11 (+ (- 1) (select .cse171 .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-12-14 07:36:59,040 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-12-14 07:37:00,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:37:02,526 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-12-14 07:37:05,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:37:07,811 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-12-14 07:37:13,004 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 [1] [2022-12-14 07:37:15,614 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-12-14 07:37:18,351 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-12-14 07:37:21,102 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-12-14 07:37:28,902 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-12-14 07:37:42,939 WARN L233 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 237 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:38:01,321 WARN L233 SmtUtils]: Spent 11.60s 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-12-14 07:38:18,731 WARN L233 SmtUtils]: Spent 9.46s 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-12-14 07:38:34,608 WARN L233 SmtUtils]: Spent 11.11s 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-12-14 07:38:37,608 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 ((.cse1 (< 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 .cse1)) (.cse41 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse42 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (mod c_~N~0 4294967296) 536870911) .cse1 (or (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|)) (= .cse2 (+ 5 (select .cse0 .cse3)))))) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse4) (not (= c_~N~0 .cse4)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (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-12-14 07:38:45,760 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 ((.cse0 (< 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 .cse0)) (.cse41 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse42 (< 5 c_~N~0))) (and (<= (mod c_~N~0 4294967296) 536870911) .cse0 (or (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|)) (= .cse1 (+ 5 (select .cse2 .cse3)))))) (= 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse4) (not (= c_~N~0 .cse4)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (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 [2022-12-14 07:38:48,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:39:10,772 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse81 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse47 (+ .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse97 (store .cse0 .cse47 1))) (let ((.cse15 (store .cse97 (+ .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse40 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse37 (not (< 4 c_~N~0))) (.cse38 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse39 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (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 ((.cse1 (let ((.cse14 (let ((.cse16 (* 4 v_subst_7))) (store (store .cse15 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse13 (* 4 v_subst_4))) (let ((.cse12 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse8 .cse9 .cse10 .cse11 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12)))))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse2 .cse3)))) .cse4 v_ArrVal_928) .cse5 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 ((.cse25 (let ((.cse26 (* 4 v_subst_6))) (store (store .cse15 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse24 (* 4 v_subst_3))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse20 .cse21 .cse22 .cse23)))))))))) |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 ((.cse35 (let ((.cse36 (* 4 v_subst_8))) (store (store .cse15 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse33 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse34 (* 4 v_subst_5))) (let ((.cse32 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse31 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)))) (+ .cse27 .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse31 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse34)) .cse31 .cse32 .cse33))))))))))) (< (+ 2 v_subst_8) c_~N~0) (not (< (+ v_subst_8 1) c_~N~0))))) .cse37 .cse38 .cse39) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) |c_ULTIMATE.start_main_~i~0#1|) (or .cse40 .cse37 (let ((.cse44 (+ .cse46 (select .cse0 .cse47)))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse41 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse41)) .cse3 (+ (- 1) (select .cse43 .cse3))) .cse4 v_ArrVal_928) .cse5 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse44 c_~N~0)))))) .cse38 .cse39) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (or .cse37 (let ((.cse59 (store .cse15 (+ .cse81 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 ((.cse48 (let ((.cse58 (let ((.cse60 (* 4 v_subst_7))) (store (store .cse59 (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse58))) (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse52 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse56 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse57 (* 4 v_subst_4))) (let ((.cse54 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse53 .cse54 .cse55 .cse56)))))))))))) (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|))) .cse3 (+ (- 1) (select .cse49 .cse3)))) .cse4 v_ArrVal_928) .cse5 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 ((.cse69 (let ((.cse70 (* 4 v_subst_8))) (store (store .cse59 (+ .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse70 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse69))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse62 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse61 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse68 (* 4 v_subst_5))) (let ((.cse63 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse68)))) (+ .cse61 .cse62 .cse63 .cse64 .cse65 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse68))))))))))) (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 ((.cse79 (let ((.cse80 (* 4 v_subst_6))) (store (store .cse59 (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse79))) (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse74 (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse76 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse75 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse78 (* 4 v_subst_3))) (let ((.cse77 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse75 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse78 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse73 .cse74 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse75 .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse78 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse75 .cse76 .cse77)))))))))) |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 .cse40) .cse39) (= .cse46 c_~N~0) (or (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse97))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse86 (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse90 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse88 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse87 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse88 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse92 (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88 .cse90))) |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 ((.cse82 (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse91 (* 4 v_subst_4))) (let ((.cse89 (select .cse92 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse86 .cse87 .cse88 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88 .cse89 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse89 .cse90))))))) (store .cse82 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse83 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse83 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3 (+ (- 1) (select .cse83 .cse3)))) .cse4 v_ArrVal_928) .cse5 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 .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse94 (* 4 v_subst_3))) (let ((.cse93 (select .cse92 (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse93 .cse86 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse86 .cse87 .cse88 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse94 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse87 .cse88 .cse90))))) |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 ((.cse96 (* 4 v_subst_5))) (let ((.cse95 (select .cse92 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse96)))) (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88 .cse95 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse96)) .cse86 .cse87 .cse88 .cse95 .cse90)))) (not (< (+ v_subst_5 1) c_~N~0))))))))))) .cse40 .cse37 .cse38 .cse39)))))) is different from true [2022-12-14 07:39:19,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse10 (< 4 c_~N~0)) (.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (select .cse0 .cse2)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse35 (select .cse0 .cse25)) (.cse26 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse27 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (= .cse14 c_~N~0)) (.cse5 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse8 (not .cse10)) (.cse36 (not .cse7)) (.cse9 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (or (and (= .cse1 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 .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse1)) .cse2 (+ (- 1) .cse3)) .cse4 v_ArrVal_928) .cse5 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse6) .cse7 .cse8 .cse9) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= (mod c_~N~0 4294967296) 536870911) .cse10 (or .cse7 .cse8 (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse1))) |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 ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse18 (* 4 v_subst_4))) (let ((.cse17 (select .cse19 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse17 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse15 .cse16 .cse17 .cse1))))))) (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse12 .cse2)))) .cse4 v_ArrVal_928) .cse5 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 .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (* 4 v_subst_3))) (let ((.cse20 (select .cse19 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse14 .cse20 .cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse20 .cse15 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse16 .cse1))))) |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 ((.cse23 (* 4 v_subst_5))) (let ((.cse22 (select .cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)))) (+ .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse22 .cse15 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse23)) .cse22 .cse15 .cse16 .cse1)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse9) (or (not .cse24) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse0 .cse25 v_ArrVal_928) .cse26 v_ArrVal_932) .cse27 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 .cse25 v_ArrVal_928) .cse26 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)) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse28 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse28) (= c_~N~0 .cse28) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse28 (+ 5 .cse3))))) (= 0 .cse1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse29 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse29) (not (= c_~N~0 .cse29)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or .cse30 .cse8 (let ((.cse34 (+ .cse14 .cse35))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse34)))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse31 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse31)) .cse2 (+ (- 1) (select .cse33 .cse2))) .cse4 v_ArrVal_928) .cse5 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse34 c_~N~0)))))) .cse36 .cse9) (or .cse30 (and (forall ((v_ArrVal_933 Int)) (= (select (store .cse0 .cse25 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse6) .cse36) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (= .cse35 0) (or .cse24 (not .cse30) (and (forall ((v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= 0 (select (store (store .cse0 .cse25 v_ArrVal_932) .cse26 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 .cse25 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (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 ((.cse38 (+ .cse40 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (+ .cse40 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse6) (let ((.cse37 (store (store .cse0 .cse25 (+ (- 1) .cse35)) .cse26 (+ (- 1) (select .cse0 .cse26))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse37 .cse27 v_ArrVal_928) .cse38 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 .cse37 .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (- 1) (select v_ArrVal_920 .cse26))) .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (select v_ArrVal_920 .cse26) 1)) .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (select v_ArrVal_920 .cse26) 1)) .cse27 v_ArrVal_928) .cse38 v_ArrVal_932) .cse39 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 .cse26 (+ (- 1) (select v_ArrVal_920 .cse26))) .cse27 v_ArrVal_928) .cse38 v_ArrVal_932) .cse39 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|)))))) .cse6)))) (<= |c_ULTIMATE.start_main_~i~0#1| 5) (or (let ((.cse56 (store .cse0 .cse25 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse46 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse51 (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse49))) |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 ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (* 4 v_subst_4))) (let ((.cse48 (select .cse51 (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse45 .cse46 .cse47 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse48 .cse49))))))) (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse42 .cse2)))) .cse4 v_ArrVal_928) .cse5 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 .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse53 (* 4 v_subst_3))) (let ((.cse52 (select .cse51 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse52 .cse45 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse45 .cse46 .cse47 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse46 .cse47 .cse49))))) |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 ((.cse55 (* 4 v_subst_5))) (let ((.cse54 (select .cse51 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse55)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse54 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse55)) .cse45 .cse46 .cse47 .cse54 .cse49)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse30 .cse8 .cse36 .cse9))))) is different from false [2022-12-14 07:39:21,507 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse10 (< 4 c_~N~0)) (.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (select .cse0 .cse2)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse35 (select .cse0 .cse25)) (.cse26 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse27 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (= .cse14 c_~N~0)) (.cse5 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse8 (not .cse10)) (.cse36 (not .cse7)) (.cse9 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (or (and (= .cse1 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 .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse1)) .cse2 (+ (- 1) .cse3)) .cse4 v_ArrVal_928) .cse5 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) .cse6) .cse7 .cse8 .cse9) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= (mod c_~N~0 4294967296) 536870911) .cse10 (or .cse7 .cse8 (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse1))) |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 ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse18 (* 4 v_subst_4))) (let ((.cse17 (select .cse19 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse17 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse15 .cse16 .cse17 .cse1))))))) (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse12 .cse2)))) .cse4 v_ArrVal_928) .cse5 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 .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (* 4 v_subst_3))) (let ((.cse20 (select .cse19 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse14 .cse20 .cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse20 .cse15 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse16 .cse1))))) |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 ((.cse23 (* 4 v_subst_5))) (let ((.cse22 (select .cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)))) (+ .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse22 .cse15 .cse16 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse23)) .cse22 .cse15 .cse16 .cse1)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse9) (or (not .cse24) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse0 .cse25 v_ArrVal_928) .cse26 v_ArrVal_932) .cse27 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 .cse25 v_ArrVal_928) .cse26 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)) (or (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse28 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse28) (= c_~N~0 .cse28) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse28 (+ 5 .cse3))))) (= 0 .cse1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse29 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= 5 .cse29) (not (= c_~N~0 .cse29)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or .cse30 .cse8 (let ((.cse34 (+ .cse14 .cse35))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse34)))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse31 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse31)) .cse2 (+ (- 1) (select .cse33 .cse2))) .cse4 v_ArrVal_928) .cse5 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (= .cse34 c_~N~0)))))) .cse36 .cse9) (or .cse30 (and (forall ((v_ArrVal_933 Int)) (= (select (store .cse0 .cse25 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse6) .cse36) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (= .cse35 0) (or .cse24 (not .cse30) (and (forall ((v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= 0 (select (store (store .cse0 .cse25 v_ArrVal_932) .cse26 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 .cse25 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (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 ((.cse38 (+ .cse40 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (+ .cse40 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse6) (let ((.cse37 (store (store .cse0 .cse25 (+ (- 1) .cse35)) .cse26 (+ (- 1) (select .cse0 .cse26))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse37 .cse27 v_ArrVal_928) .cse38 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 .cse37 .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (- 1) (select v_ArrVal_920 .cse26))) .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (select v_ArrVal_920 .cse26) 1)) .cse27 v_ArrVal_928) .cse38 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 .cse26 (+ (select v_ArrVal_920 .cse26) 1)) .cse27 v_ArrVal_928) .cse38 v_ArrVal_932) .cse39 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 .cse26 (+ (- 1) (select v_ArrVal_920 .cse26))) .cse27 v_ArrVal_928) .cse38 v_ArrVal_932) .cse39 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|)))))) .cse6)))) (<= |c_ULTIMATE.start_main_~i~0#1| 5) (or (let ((.cse56 (store .cse0 .cse25 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse46 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse51 (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse49))) |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 ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (* 4 v_subst_4))) (let ((.cse48 (select .cse51 (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse45 .cse46 .cse47 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse48 .cse49))))))) (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse42 .cse2)))) .cse4 v_ArrVal_928) .cse5 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 .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse53 (* 4 v_subst_3))) (let ((.cse52 (select .cse51 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse52 .cse45 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse45 .cse46 .cse47 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse46 .cse47 .cse49))))) |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 ((.cse55 (* 4 v_subst_5))) (let ((.cse54 (select .cse51 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse55)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse54 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse55)) .cse45 .cse46 .cse47 .cse54 .cse49)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse30 .cse8 .cse36 .cse9))))) is different from true [2022-12-14 07:39:23,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse36 (* |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|)) (.cse23 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse31 (select .cse0 .cse23)) (.cse24 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse25 (+ .cse36 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)) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse7 (not (< 4 c_~N~0))) (.cse32 (not .cse6)) (.cse8 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (or (and (= .cse1 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 .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse1)) .cse2 (+ (- 1) (select .cse0 .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) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (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 .cse1))) |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 .cse1))) |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 .cse1))) |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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse14 .cse15 .cse1))))))) (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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse14 .cse1))))) |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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse21)) .cse20 .cse13 .cse14 .cse1)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or (not .cse22) (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|)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (or .cse26 .cse7 (let ((.cse30 (+ .cse12 .cse31))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse30)))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse27 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse27)) .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|))) (= .cse30 c_~N~0)))))) .cse32 .cse8) (or .cse26 (and (forall ((v_ArrVal_933 Int)) (= (select (store .cse0 .cse23 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse5) .cse32) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (or .cse22 (not .cse26) (and (forall ((v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= 0 (select (store (store .cse0 .cse23 v_ArrVal_932) .cse24 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 .cse23 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (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 (+ .cse36 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (+ .cse36 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse5) (let ((.cse33 (store (store .cse0 .cse23 (+ (- 1) .cse31)) .cse24 (+ (- 1) (select .cse0 .cse24))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse33 .cse25 v_ArrVal_928) .cse34 v_ArrVal_932) .cse35 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 .cse33 .cse25 v_ArrVal_928) .cse34 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) .cse34 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) .cse34 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) .cse34 v_ArrVal_932) .cse35 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) .cse34 v_ArrVal_932) .cse35 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 ((.cse52 (store .cse0 .cse23 1))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse42 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse47 (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse45))) |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 ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (* 4 v_subst_4))) (let ((.cse44 (select .cse47 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse42 .cse43 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse44 .cse45))))))) (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse38 .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 .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (* 4 v_subst_3))) (let ((.cse48 (select .cse47 (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse48 .cse41 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse41 .cse42 .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse42 .cse43 .cse45))))) |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 ((.cse51 (* 4 v_subst_5))) (let ((.cse50 (select .cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51)))) (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse50 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse51)) .cse41 .cse42 .cse43 .cse50 .cse45)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse26 .cse7 .cse32 .cse8))))) is different from false [2022-12-14 07:39:25,594 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse36 (* |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|)) (.cse23 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse31 (select .cse0 .cse23)) (.cse24 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse25 (+ .cse36 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)) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse7 (not (< 4 c_~N~0))) (.cse32 (not .cse6)) (.cse8 (< 5 c_~N~0))) (and (= (select .cse0 0) 0) (or (and (= .cse1 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 .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse1)) .cse2 (+ (- 1) (select .cse0 .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) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (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 .cse1))) |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 .cse1))) |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 .cse1))) |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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse13 .cse14 .cse15 .cse1))))))) (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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse14 .cse1))))) |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 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse21)) .cse20 .cse13 .cse14 .cse1)))) (not (< (+ v_subst_5 1) c_~N~0)))))))) .cse8) (or (not .cse22) (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|)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (or .cse26 .cse7 (let ((.cse30 (+ .cse12 .cse31))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse30)))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse27 1) (forall ((v_ArrVal_928 Int) (v_ArrVal_932 Int)) (= c_~N~0 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) .cse27)) .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|))) (= .cse30 c_~N~0)))))) .cse32 .cse8) (or .cse26 (and (forall ((v_ArrVal_933 Int)) (= (select (store .cse0 .cse23 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse5) .cse32) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 5) (or .cse22 (not .cse26) (and (forall ((v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= 0 (select (store (store .cse0 .cse23 v_ArrVal_932) .cse24 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 .cse23 v_ArrVal_932)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (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 (+ .cse36 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (+ .cse36 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not .cse5) (let ((.cse33 (store (store .cse0 .cse23 (+ (- 1) .cse31)) .cse24 (+ (- 1) (select .cse0 .cse24))))) (and (forall ((v_ArrVal_928 Int) (v_ArrVal_933 Int) (v_ArrVal_932 Int)) (= (select (store (store (store .cse33 .cse25 v_ArrVal_928) .cse34 v_ArrVal_932) .cse35 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 .cse33 .cse25 v_ArrVal_928) .cse34 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) .cse34 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) .cse34 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) .cse34 v_ArrVal_932) .cse35 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) .cse34 v_ArrVal_932) .cse35 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 ((.cse52 (store .cse0 .cse23 1))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse42 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse47 (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse45))) |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 ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (* 4 v_subst_4))) (let ((.cse44 (select .cse47 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse41 .cse42 .cse43 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse44 .cse45))))))) (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2 (+ (- 1) (select .cse38 .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 .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (* 4 v_subst_3))) (let ((.cse48 (select .cse47 (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse48 .cse41 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse41 .cse42 .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse42 .cse43 .cse45))))) |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 ((.cse51 (* 4 v_subst_5))) (let ((.cse50 (select .cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51)))) (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse50 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse51)) .cse41 .cse42 .cse43 .cse50 .cse45)))) (not (< (+ v_subst_5 1) c_~N~0)))))))))))) .cse26 .cse7 .cse32 .cse8))))) is different from true [2022-12-14 07:39:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:39:27,611 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2022-12-14 07:39:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 07:39:27,612 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 23 [2022-12-14 07:39:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:39:27,613 INFO L225 Difference]: With dead ends: 114 [2022-12-14 07:39:27,613 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 07:39:27,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 407.9s TimeCoverageRelationStatistics Valid=962, Invalid=8751, Unknown=45, NotChecked=2898, Total=12656 [2022-12-14 07:39:27,616 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 118 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 108.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:39:27,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 164 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1401 Invalid, 10 Unknown, 134 Unchecked, 108.5s Time] [2022-12-14 07:39:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 07:39:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2022-12-14 07:39:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 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-12-14 07:39:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2022-12-14 07:39:27,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 23 [2022-12-14 07:39:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:39:27,705 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2022-12-14 07:39:27,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-14 07:39:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-12-14 07:39:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 07:39:27,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:39:27,706 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:39:27,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 07:39:27,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:39:27,907 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:39:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:39:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1420345498, now seen corresponding path program 3 times [2022-12-14 07:39:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:39:27,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133660472] [2022-12-14 07:39:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:39:27,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:39:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:39:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 07:39:28,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:39:28,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133660472] [2022-12-14 07:39:28,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133660472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:39:28,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19847572] [2022-12-14 07:39:28,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:39:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:39:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:39:28,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:39:28,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 07:39:28,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:39:28,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:39:28,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:39:28,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:39:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 07:39:29,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:39:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 07:39:29,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19847572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:39:29,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412277133] [2022-12-14 07:39:29,664 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:39:29,665 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:39:29,665 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:39:29,665 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:39:29,665 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:39:29,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:29,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:29,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,069 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:39:30,070 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-12-14 07:39:30,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,109 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-12-14 07:39:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,135 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-12-14 07:39:30,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,183 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-12-14 07:39:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:30,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:30,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:30,550 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:39:30,551 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-12-14 07:39:30,630 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-12-14 07:39:30,769 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:39:30,770 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-12-14 07:39:31,000 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:39:31,000 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-12-14 07:39:31,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:31,165 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:39:31,166 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-12-14 07:39:31,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:31,241 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:39:31,241 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-12-14 07:39:31,503 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:39:31,503 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-12-14 07:39:31,627 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:39:31,628 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-12-14 07:39:31,716 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:39:34,467 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4716#(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-12-14 07:39:34,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:39:34,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:39:34,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 20 [2022-12-14 07:39:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176345464] [2022-12-14 07:39:34,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:39:34,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:39:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:39:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:39:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-12-14 07:39:34,469 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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-12-14 07:39:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:39:35,465 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-12-14 07:39:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:39:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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 24 [2022-12-14 07:39:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:39:35,466 INFO L225 Difference]: With dead ends: 128 [2022-12-14 07:39:35,466 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 07:39:35,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2022-12-14 07:39:35,467 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:39:35,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 63 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 07:39:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 07:39:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-12-14 07:39:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 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-12-14 07:39:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-12-14 07:39:35,564 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 24 [2022-12-14 07:39:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:39:35,564 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-12-14 07:39:35,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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-12-14 07:39:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-12-14 07:39:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 07:39:35,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:39:35,565 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:39:35,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 07:39:35,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 07:39:35,766 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:39:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:39:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -230939481, now seen corresponding path program 12 times [2022-12-14 07:39:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:39:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849683252] [2022-12-14 07:39:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:39:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:39:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:39:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:39:36,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:39:36,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849683252] [2022-12-14 07:39:36,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849683252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:39:36,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199117617] [2022-12-14 07:39:36,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:39:36,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:39:36,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:39:36,411 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:39:36,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 07:39:36,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:39:36,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:39:36,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 07:39:36,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:39:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:39:37,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:39:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:39:39,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199117617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:39:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447105649] [2022-12-14 07:39:39,136 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:39:39,136 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:39:39,136 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:39:39,137 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:39:39,137 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:39:39,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,566 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:39:39,566 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-12-14 07:39:39,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,607 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-12-14 07:39:39,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,666 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-12-14 07:39:39,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,733 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-12-14 07:39:39,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:39,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:39,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:40,171 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-12-14 07:39:40,171 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-12-14 07:39:40,258 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-12-14 07:39:40,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:40,416 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-12-14 07:39:40,417 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-12-14 07:39:40,687 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:39:40,687 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-12-14 07:39:40,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:40,881 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:39:40,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 38 [2022-12-14 07:39:40,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:39:40,969 INFO L321 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2022-12-14 07:39:40,969 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-12-14 07:39:41,233 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:39:41,233 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-12-14 07:39:41,360 INFO L321 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-12-14 07:39:41,360 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-12-14 07:39:41,406 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:39:45,543 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5267#(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-12-14 07:39:45,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:39:45,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:39:45,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 33 [2022-12-14 07:39:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063432037] [2022-12-14 07:39:45,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:39:45,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 07:39:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:39:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 07:39:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 07:39:45,545 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-12-14 07:39:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:39:51,662 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-12-14 07:39:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 07:39:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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 24 [2022-12-14 07:39:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:39:51,664 INFO L225 Difference]: With dead ends: 156 [2022-12-14 07:39:51,664 INFO L226 Difference]: Without dead ends: 130 [2022-12-14 07:39:51,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 29 SyntacticMatches, 20 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=685, Invalid=4285, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 07:39:51,665 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 288 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:39:51,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 332 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 07:39:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-14 07:39:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 69. [2022-12-14 07:39:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 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-12-14 07:39:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-12-14 07:39:51,750 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 24 [2022-12-14 07:39:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:39:51,750 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-12-14 07:39:51,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-12-14 07:39:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-12-14 07:39:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:39:51,751 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:39:51,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:39:51,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 07:39:51,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 07:39:51,953 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:39:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:39:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1643802139, now seen corresponding path program 4 times [2022-12-14 07:39:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:39:51,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41994561] [2022-12-14 07:39:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:39:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:39:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:39:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:39:57,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:39:57,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41994561] [2022-12-14 07:39:57,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41994561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:39:57,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772602903] [2022-12-14 07:39:57,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:39:57,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:39:57,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:39:57,831 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:39:57,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ba4990-c46d-41a4-976c-b5c38841e50d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 07:39:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:39:57,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-14 07:39:57,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:39:57,954 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-12-14 07:39:58,352 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 13 treesize of output 9 [2022-12-14 07:39:58,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 07:39:58,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:58,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:58,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 07:39:59,382 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 25 treesize of output 25 [2022-12-14 07:39:59,659 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 25 treesize of output 25 [2022-12-14 07:39:59,709 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 25 treesize of output 25 [2022-12-14 07:39:59,757 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 30 treesize of output 32 [2022-12-14 07:39:59,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:59,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:59,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 111 [2022-12-14 07:40:00,040 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 42 treesize of output 28 [2022-12-14 07:40:00,051 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 28 treesize of output 16 [2022-12-14 07:40:00,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:00,322 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 95 [2022-12-14 07:40:00,465 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-12-14 07:40:00,485 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-12-14 07:40:00,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:00,511 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 18 treesize of output 7 [2022-12-14 07:40:00,973 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 96 treesize of output 98 [2022-12-14 07:40:01,075 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 35 treesize of output 28 [2022-12-14 07:40:01,088 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-12-14 07:40:01,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:01,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:01,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:01,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 137 [2022-12-14 07:40:01,649 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 54 treesize of output 42 [2022-12-14 07:40:01,795 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 50 treesize of output 41 [2022-12-14 07:40:01,807 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-12-14 07:40:01,863 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 34 treesize of output 22 [2022-12-14 07:40:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:40:04,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:26,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:26,902 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 100 treesize of output 94 [2022-12-14 07:40:26,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:26,952 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 128 treesize of output 116 [2022-12-14 07:40:27,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_58 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1212 Int) (v_ArrVal_1223 Int)) (let ((.cse0 (store (store (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1212) .cse1 (+ (select .cse3 .cse1) 1))) .cse2 v_ArrVal_1221) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (not (= (select .cse0 .cse1) 0)) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|)) (= (select .cse0 .cse2) 0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_59 (Array Int Int)) (v_ArrVal_1211 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1223 Int) (v_ArrVal_1215 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_59))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1211))) (let ((.cse4 (store (store (store .cse6 .cse1 v_ArrVal_1215) .cse2 (+ (- 1) (select .cse7 .cse2))) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (= (select .cse4 .cse2) 0) (not (= (select .cse4 .cse1) 0)) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|)) (not (= (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_59 |ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) is different from false [2022-12-14 07:40:27,333 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_58 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1212 Int) (v_ArrVal_1223 Int) (v_ArrVal_1204 Int)) (let ((.cse0 (store (store (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1212) .cse1 (+ (select .cse3 .cse1) 1))) .cse2 v_ArrVal_1221) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (not (= (select .cse0 .cse1) 0)) (= (select .cse0 .cse2) 0) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_59 (Array Int Int)) (v_ArrVal_1211 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1223 Int) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_59))) (let ((.cse9 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1211))) (let ((.cse8 (store (store (store .cse7 .cse1 v_ArrVal_1215) .cse2 (+ (- 1) (select .cse9 .cse2))) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (not (= (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_59 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (select .cse8 .cse1) 0)) (= (select .cse8 .cse2) 0) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|)))))))))) is different from false [2022-12-14 07:40:27,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (store (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|) 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_529| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_529|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_58 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1212 Int) (v_ArrVal_1223 Int) (v_ArrVal_1204 Int)) (let ((.cse1 (store (store (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_529| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1204)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1212) .cse3 (+ (select .cse4 .cse3) 1))) .cse2 v_ArrVal_1221) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (= (select .cse1 .cse2) 0) (not (= (select .cse1 .cse3) 0)) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_529| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_520| Int) (v_arrayElimArr_59 (Array Int Int)) (v_ArrVal_1211 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1223 Int) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_529| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1204)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_59))) (let ((.cse9 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1211))) (let ((.cse8 (store (store (store .cse7 .cse3 v_ArrVal_1215) .cse2 (+ (select .cse9 .cse2) (- 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_520| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1223))) (or (not (= (select v_arrayElimArr_59 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_520|)) (not (= (select .cse8 .cse3) 0)) (= (select .cse8 .cse2) 0))))))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_529|)))))) is different from false [2022-12-14 07:40:27,625 INFO L321 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-12-14 07:40:27,625 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 274 treesize of output 149 [2022-12-14 07:40:27,639 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 239 treesize of output 225 [2022-12-14 07:40:27,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:27,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:27,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:27,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 82 [2022-12-14 07:40:27,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:27,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:27,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:27,751 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 52 treesize of output 55 [2022-12-14 07:40:27,945 INFO L321 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-12-14 07:40:27,946 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 3 case distinctions, treesize of input 196 treesize of output 125 [2022-12-14 07:40:27,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:27,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2022-12-14 07:40:28,013 INFO L321 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2022-12-14 07:40:28,014 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 69 treesize of output 57 [2022-12-14 07:40:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-12-14 07:40:28,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772602903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:40:28,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212964205] [2022-12-14 07:40:28,623 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:40:28,623 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:40:28,623 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:40:28,624 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:40:28,624 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:40:28,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:28,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:28,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,039 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-12-14 07:40:29,040 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-12-14 07:40:29,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,075 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-12-14 07:40:29,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,101 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-12-14 07:40:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,156 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-12-14 07:40:29,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:29,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:29,552 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-12-14 07:40:29,552 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-12-14 07:40:29,633 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-12-14 07:40:29,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:29,804 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:40:29,804 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-12-14 07:40:30,077 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-12-14 07:40:30,077 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-12-14 07:40:30,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:30,284 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:40:30,284 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-12-14 07:40:30,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:30,462 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 07:40:30,462 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-12-14 07:40:30,750 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:40:30,751 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-12-14 07:40:30,995 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-12-14 07:40:30,996 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-12-14 07:40:31,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:40:34,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5915#(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-12-14 07:40:34,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:40:34,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:40:34,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 58 [2022-12-14 07:40:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929931024] [2022-12-14 07:40:34,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:40:34,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-14 07:40:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-14 07:40:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3240, Unknown=6, NotChecked=354, Total=3906 [2022-12-14 07:40:34,557 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 58 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 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-12-14 07:40:42,357 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-12-14 07:40:44,524 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-12-14 07:40:46,960 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-12-14 07:40:48,997 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-12-14 07:40:51,031 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-12-14 07:40:53,339 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-12-14 07:40:55,384 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-12-14 07:41:00,516 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-12-14 07:41:02,521 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-12-14 07:41:04,525 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-12-14 07:41:06,567 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-12-14 07:41:08,573 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-12-14 07:41:10,575 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-12-14 07:41:12,583 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-12-14 07:41:14,585 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-12-14 07:41:16,590 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-12-14 07:41:18,595 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-12-14 07:41:20,611 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-12-14 07:41:22,613 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-12-14 07:41:24,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:41:26,635 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]