./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s2if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/s2if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:10:43,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:10:43,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:10:44,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:10:44,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:10:44,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:10:44,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:10:44,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:10:44,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:10:44,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:10:44,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:10:44,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:10:44,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:10:44,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:10:44,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:10:44,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:10:44,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:10:44,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:10:44,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:10:44,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:10:44,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:10:44,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:10:44,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:10:44,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:10:44,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:10:44,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:10:44,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:10:44,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:10:44,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:10:44,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:10:44,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:10:44,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:10:44,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:10:44,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:10:44,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:10:44,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:10:44,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:10:44,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:10:44,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:10:44,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:10:44,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:10:44,089 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:10:44,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:10:44,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:10:44,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:10:44,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:10:44,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:10:44,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:10:44,131 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:10:44,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:10:44,132 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:10:44,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:10:44,132 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:10:44,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:10:44,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:10:44,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:10:44,133 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:10:44,133 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:10:44,133 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:10:44,133 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:10:44,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:10:44,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:10:44,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:10:44,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:10:44,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:10:44,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:10:44,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:10:44,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:10:44,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:10:44,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:10:44,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:10:44,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:10:44,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:10:44,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:10:44,138 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:10:44,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:10:44,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:10:44,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:10:44,138 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_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 [2022-11-03 02:10:44,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:10:44,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:10:44,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:10:44,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:10:44,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:10:44,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/s2if.c [2022-11-03 02:10:44,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/8b7eb443d/f59e1a232a7e42c28a9fdb60695de5f7/FLAG08398fcf8 [2022-11-03 02:10:44,997 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:10:44,997 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c [2022-11-03 02:10:45,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/8b7eb443d/f59e1a232a7e42c28a9fdb60695de5f7/FLAG08398fcf8 [2022-11-03 02:10:45,387 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/8b7eb443d/f59e1a232a7e42c28a9fdb60695de5f7 [2022-11-03 02:10:45,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:10:45,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:10:45,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:10:45,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:10:45,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:10:45,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed3ec8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45, skipping insertion in model container [2022-11-03 02:10:45,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:10:45,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:10:45,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-03 02:10:45,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:10:45,652 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:10:45,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-03 02:10:45,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:10:45,688 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:10:45,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45 WrapperNode [2022-11-03 02:10:45,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:10:45,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:10:45,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:10:45,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:10:45,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,725 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-03 02:10:45,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:10:45,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:10:45,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:10:45,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:10:45,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:10:45,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:10:45,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:10:45,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:10:45,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (1/1) ... [2022-11-03 02:10:45,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:10:45,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:45,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:10:45,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:10:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:10:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:10:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:10:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:10:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:10:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:10:45,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:10:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:10:45,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:10:45,899 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:10:45,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:10:46,051 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:10:46,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:10:46,126 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:10:46,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:46 BoogieIcfgContainer [2022-11-03 02:10:46,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:10:46,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:10:46,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:10:46,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:10:46,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:10:45" (1/3) ... [2022-11-03 02:10:46,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127f8ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:10:46, skipping insertion in model container [2022-11-03 02:10:46,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:45" (2/3) ... [2022-11-03 02:10:46,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127f8ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:10:46, skipping insertion in model container [2022-11-03 02:10:46,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:46" (3/3) ... [2022-11-03 02:10:46,141 INFO L112 eAbstractionObserver]: Analyzing ICFG s2if.c [2022-11-03 02:10:46,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:10:46,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:10:46,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:10:46,248 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;@22f9a5fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:10:46,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:10:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:10:46,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:46,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:10:46,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1569409207, now seen corresponding path program 1 times [2022-11-03 02:10:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:46,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650743026] [2022-11-03 02:10:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:46,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650743026] [2022-11-03 02:10:46,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650743026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:10:46,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:10:46,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:10:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092537246] [2022-11-03 02:10:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:10:46,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:10:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:10:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:10:46,684 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:46,725 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-11-03 02:10:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:10:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-03 02:10:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:46,736 INFO L225 Difference]: With dead ends: 18 [2022-11-03 02:10:46,736 INFO L226 Difference]: Without dead ends: 8 [2022-11-03 02:10:46,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:10:46,742 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:46,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:10:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-03 02:10:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-03 02:10:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-03 02:10:46,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-03 02:10:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:46,774 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-03 02:10:46,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-03 02:10:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:10:46,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:46,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:46,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:10:46,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1413550180, now seen corresponding path program 1 times [2022-11-03 02:10:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:46,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224074268] [2022-11-03 02:10:46,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:47,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:47,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224074268] [2022-11-03 02:10:47,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224074268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:10:47,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:10:47,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:10:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059943406] [2022-11-03 02:10:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:10:47,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:10:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:10:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:10:47,031 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:47,087 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-03 02:10:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:10:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 02:10:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:47,089 INFO L225 Difference]: With dead ends: 12 [2022-11-03 02:10:47,089 INFO L226 Difference]: Without dead ends: 9 [2022-11-03 02:10:47,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:10:47,091 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:47,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-03 02:10:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-03 02:10:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-03 02:10:47,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2022-11-03 02:10:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:47,097 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-03 02:10:47,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-03 02:10:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:10:47,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:47,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:47,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:10:47,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -870274037, now seen corresponding path program 1 times [2022-11-03 02:10:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75885550] [2022-11-03 02:10:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:47,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:47,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949961827] [2022-11-03 02:10:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:47,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:47,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:10:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:47,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:10:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:47,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:10:47,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:10:47,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:10:47,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:10:47,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-03 02:10:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:47,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:47,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:10:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:47,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75885550] [2022-11-03 02:10:47,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949961827] [2022-11-03 02:10:47,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949961827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102668547] [2022-11-03 02:10:47,986 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:47,987 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:47,991 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:47,997 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:47,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:48,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,223 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:10:48,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:10:48,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,360 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:48,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:10:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:10:48,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:48,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:48,817 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:10:48,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:10:48,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:49,023 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:49,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:10:49,102 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:49,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:10:49,221 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:49,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:10:49,330 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:49,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:10:49,372 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:49,855 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '137#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:49,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:49,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:49,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-03 02:10:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829560083] [2022-11-03 02:10:49,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:49,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:10:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:10:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:10:49,858 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:49,934 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-03 02:10:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:10:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:10:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:49,935 INFO L225 Difference]: With dead ends: 15 [2022-11-03 02:10:49,936 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 02:10:49,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:10:49,937 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:49,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2022-11-03 02:10:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 02:10:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-03 02:10:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-03 02:10:49,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2022-11-03 02:10:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:49,942 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-03 02:10:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-03 02:10:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:10:49,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:49,943 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:49,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:50,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-03 02:10:50,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1208582788, now seen corresponding path program 2 times [2022-11-03 02:10:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:50,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410697505] [2022-11-03 02:10:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:50,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:50,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101802385] [2022-11-03 02:10:50,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:10:50,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:50,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:50,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:50,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:10:50,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:10:50,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:50,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:10:50,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:50,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:50,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410697505] [2022-11-03 02:10:50,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101802385] [2022-11-03 02:10:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101802385] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [731298027] [2022-11-03 02:10:50,371 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:50,371 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:50,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:50,372 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:50,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:50,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,474 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:10:50,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:10:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,518 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:10:50,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:10:50,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,641 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:50,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:50,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:10:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:50,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:50,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:50,947 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:10:50,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:10:51,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:51,124 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:51,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:10:51,189 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:51,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:10:51,293 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:51,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:10:51,359 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:51,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:10:51,458 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:51,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '236#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:51,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:51,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:51,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-03 02:10:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890400888] [2022-11-03 02:10:51,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:51,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:10:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:10:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:10:51,874 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:51,964 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-11-03 02:10:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:10:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:10:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:51,966 INFO L225 Difference]: With dead ends: 20 [2022-11-03 02:10:51,966 INFO L226 Difference]: Without dead ends: 14 [2022-11-03 02:10:51,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:10:51,967 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:51,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-03 02:10:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2022-11-03 02:10:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-03 02:10:51,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2022-11-03 02:10:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-03 02:10:51,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-03 02:10:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:10:51,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:51,972 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:51,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:52,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:52,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1413604450, now seen corresponding path program 3 times [2022-11-03 02:10:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:52,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995936134] [2022-11-03 02:10:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:52,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:52,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158521020] [2022-11-03 02:10:52,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:10:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:52,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:52,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:10:52,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:10:52,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:52,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:10:52,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:52,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:52,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995936134] [2022-11-03 02:10:52,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158521020] [2022-11-03 02:10:52,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158521020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703357732] [2022-11-03 02:10:52,360 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:52,360 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:52,361 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:52,361 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:52,361 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:52,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,466 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:52,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:52,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:10:52,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:10:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:52,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:52,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:52,786 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:10:52,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:10:52,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:53,034 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:53,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:10:53,091 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:53,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:10:53,178 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:53,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:10:53,237 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:53,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:10:53,304 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:53,695 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '347#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:53,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:53,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:53,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-03 02:10:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370973776] [2022-11-03 02:10:53,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:10:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:10:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:10:53,698 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:53,811 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-11-03 02:10:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:10:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:10:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:53,812 INFO L225 Difference]: With dead ends: 14 [2022-11-03 02:10:53,812 INFO L226 Difference]: Without dead ends: 11 [2022-11-03 02:10:53,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:10:53,813 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:53,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-03 02:10:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-03 02:10:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-03 02:10:53,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2022-11-03 02:10:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-03 02:10:53,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-03 02:10:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:10:53,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:53,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:53,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:54,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -871956407, now seen corresponding path program 4 times [2022-11-03 02:10:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:54,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000059312] [2022-11-03 02:10:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:54,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:54,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358438549] [2022-11-03 02:10:54,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:10:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:54,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:54,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:10:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:54,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 02:10:54,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:54,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:10:54,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:10:54,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:10:54,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:54,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:10:54,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 102 [2022-11-03 02:10:54,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:10:54,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 02:10:54,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-03 02:10:54,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-03 02:10:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:54,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:54,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:10:54,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (* c_~N~0 2)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= 2 .cse5))) (and (or .cse0 (and (forall ((v_ArrVal_163 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2)) (forall ((v_ArrVal_163 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select v_ArrVal_163 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)))) (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (= .cse2 (+ .cse3 .cse4 .cse5)) (= .cse4 2))))) (not .cse0)))))) is different from false [2022-11-03 02:10:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:10:55,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000059312] [2022-11-03 02:10:55,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358438549] [2022-11-03 02:10:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358438549] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690128123] [2022-11-03 02:10:55,051 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:55,052 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:55,052 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:55,052 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:55,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:55,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,168 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:55,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:55,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:10:55,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:55,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:10:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:55,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:55,483 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:10:55,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:10:55,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:55,623 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:55,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:10:55,698 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:55,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:10:55,790 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:55,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:10:55,865 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:55,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:10:55,939 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:56,481 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '465#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:56,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:56,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:56,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-03 02:10:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393892791] [2022-11-03 02:10:56,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:56,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:10:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:10:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2022-11-03 02:10:56,483 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:56,769 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-11-03 02:10:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:10:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) Word has length 10 [2022-11-03 02:10:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:56,770 INFO L225 Difference]: With dead ends: 18 [2022-11-03 02:10:56,770 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 02:10:56,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-03 02:10:56,771 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:56,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-11-03 02:10:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 02:10:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-11-03 02:10:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-11-03 02:10:56,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-11-03 02:10:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:56,777 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-11-03 02:10:56,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-11-03 02:10:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:10:56,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:56,778 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:56,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:56,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1260736258, now seen corresponding path program 5 times [2022-11-03 02:10:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431497382] [2022-11-03 02:10:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:57,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463329305] [2022-11-03 02:10:57,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:10:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:57,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:57,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:10:57,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:10:57,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:57,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:10:57,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:57,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:57,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431497382] [2022-11-03 02:10:57,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463329305] [2022-11-03 02:10:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463329305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1141194214] [2022-11-03 02:10:57,269 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:57,269 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:57,269 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:57,270 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:57,270 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,394 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:57,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:57,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:57,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:10:57,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:10:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:57,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:57,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:57,717 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:10:57,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:10:57,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:57,940 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:57,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:10:58,000 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:10:58,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:10:58,076 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:58,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:10:58,143 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:58,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:10:58,197 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:58,624 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '594#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:10:58,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:58,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-03 02:10:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607308559] [2022-11-03 02:10:58,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:10:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:10:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:10:58,626 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:58,730 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-11-03 02:10:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:10:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:10:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:58,731 INFO L225 Difference]: With dead ends: 23 [2022-11-03 02:10:58,731 INFO L226 Difference]: Without dead ends: 16 [2022-11-03 02:10:58,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:10:58,732 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:58,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-03 02:10:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2022-11-03 02:10:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-03 02:10:58,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2022-11-03 02:10:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-03 02:10:58,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-03 02:10:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:10:58,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:58,739 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:58,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:58,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:10:58,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 973526812, now seen corresponding path program 6 times [2022-11-03 02:10:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:58,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926357475] [2022-11-03 02:10:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:58,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:58,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31972439] [2022-11-03 02:10:58,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:10:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:58,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:58,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:10:59,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:10:59,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:59,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:10:59,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:59,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:59,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926357475] [2022-11-03 02:10:59,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31972439] [2022-11-03 02:10:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31972439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1316393427] [2022-11-03 02:10:59,203 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:59,203 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:59,203 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:59,203 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:59,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:59,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,305 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:10:59,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:10:59,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:10:59,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:10:59,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:10:59,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:59,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:10:59,590 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:10:59,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:10:59,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:10:59,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:59,753 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:10:59,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:10:59,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:10:59,809 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:10:59,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:10:59,911 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:10:59,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:11:00,095 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:00,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:11:00,140 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:11:00,552 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '732#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:11:00,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:11:00,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:11:00,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-03 02:11:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789454960] [2022-11-03 02:11:00,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:00,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:11:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:11:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:11:00,554 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:00,665 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-11-03 02:11:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:11:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:11:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:00,667 INFO L225 Difference]: With dead ends: 16 [2022-11-03 02:11:00,667 INFO L226 Difference]: Without dead ends: 13 [2022-11-03 02:11:00,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:11:00,668 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:00,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-03 02:11:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-03 02:11:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-03 02:11:00,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-11-03 02:11:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:00,674 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-03 02:11:00,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-03 02:11:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:11:00,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:00,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:00,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:00,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 02:11:00,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:11:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 114668683, now seen corresponding path program 7 times [2022-11-03 02:11:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88631960] [2022-11-03 02:11:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:00,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:11:00,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635159884] [2022-11-03 02:11:00,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:11:00,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:00,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:00,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:00,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:11:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:01,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:11:01,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:01,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:11:01,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:11:01,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:11:01,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 02:11:01,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:11:01,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 109 [2022-11-03 02:11:01,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:11:01,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:01,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 102 [2022-11-03 02:11:01,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 23 [2022-11-03 02:11:01,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-11-03 02:11:01,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 45 [2022-11-03 02:11:01,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2022-11-03 02:11:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:01,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:01,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:11:01,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (* c_~N~0 2)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= 2 .cse5))) (and (or .cse0 (and (forall ((v_ArrVal_320 (Array Int Int))) (= (+ (select v_ArrVal_320 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) .cse2)) (forall ((v_ArrVal_320 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (= .cse2 (+ .cse3 .cse4 .cse5)) (= .cse4 2))))) (not .cse0)))))) is different from false [2022-11-03 02:11:02,176 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (* c_~N~0 2)) (.cse3 (+ .cse14 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse11)) (.cse7 (and (forall ((v_ArrVal_320 (Array Int Int))) (= (+ (select v_ArrVal_320 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) .cse4)) (forall ((v_ArrVal_320 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (.cse5 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (let ((.cse1 (select v_ArrVal_316 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_316 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse2)) .cse4) (not (= 2 .cse2))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= 2 .cse6)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_316 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_316 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 2)))) (or .cse7 (forall ((v_ArrVal_316 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (or (not .cse0) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse8 (= .cse10 2))) (and (or .cse7 .cse8) (or (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (and (= .cse4 (+ .cse9 .cse10 .cse11 .cse12)) (= 2 .cse12))) (not .cse8)))))))))))) is different from false [2022-11-03 02:11:09,119 WARN L234 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 76 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:11:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:11:09,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:09,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88631960] [2022-11-03 02:11:09,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:11:09,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635159884] [2022-11-03 02:11:09,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635159884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133245821] [2022-11-03 02:11:09,923 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:11:09,923 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:11:09,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:11:09,924 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:11:09,924 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:11:09,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:09,976 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:11:09,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:11:09,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,126 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:11:10,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:11:10,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:11:10,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:11:10,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:10,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:10,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:10,428 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:11:10,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:11:10,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:11:10,610 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:11:10,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:11:10,674 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:11:10,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:11:10,787 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:10,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:11:10,906 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:10,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:11:10,940 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:11:11,930 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '876#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:11:11,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:11:11,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:11:11,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-03 02:11:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279524174] [2022-11-03 02:11:11,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:11,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:11:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:11,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:11:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=366, Unknown=2, NotChecked=78, Total=506 [2022-11-03 02:11:11,932 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:12,261 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-03 02:11:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:11:12,261 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:11:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:12,262 INFO L225 Difference]: With dead ends: 21 [2022-11-03 02:11:12,262 INFO L226 Difference]: Without dead ends: 18 [2022-11-03 02:11:12,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=66, Invalid=402, Unknown=2, NotChecked=82, Total=552 [2022-11-03 02:11:12,265 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:12,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-11-03 02:11:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-03 02:11:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-11-03 02:11:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-03 02:11:12,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-11-03 02:11:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:12,272 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-03 02:11:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-03 02:11:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:11:12,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:12,274 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:12,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 02:11:12,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:11:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -740129540, now seen corresponding path program 8 times [2022-11-03 02:11:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:12,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436999062] [2022-11-03 02:11:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:12,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:11:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202766130] [2022-11-03 02:11:12,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:11:12,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:12,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:12,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:11:12,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:11:12,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:11:12,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:11:12,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:12,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:12,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436999062] [2022-11-03 02:11:12,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:11:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202766130] [2022-11-03 02:11:12,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202766130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1959141915] [2022-11-03 02:11:12,874 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:11:12,874 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:11:12,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:11:12,874 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:11:12,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:11:12,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:12,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:12,997 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:11:12,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:11:13,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,126 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:11:13,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:11:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:11:13,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:11:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:13,435 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:11:13,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:11:13,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:11:13,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:13,590 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:11:13,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:11:13,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:13,662 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:11:13,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:11:13,782 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:13,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:11:13,973 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:13,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:11:14,013 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:11:14,564 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1028#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:11:14,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:11:14,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:11:14,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-03 02:11:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134740276] [2022-11-03 02:11:14,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:11:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:11:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:11:14,566 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:14,735 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-11-03 02:11:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:11:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:11:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:14,736 INFO L225 Difference]: With dead ends: 26 [2022-11-03 02:11:14,736 INFO L226 Difference]: Without dead ends: 18 [2022-11-03 02:11:14,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:11:14,737 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:14,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-03 02:11:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2022-11-03 02:11:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-03 02:11:14,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2022-11-03 02:11:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:14,744 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-03 02:11:14,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-03 02:11:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:11:14,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:14,745 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:14,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:11:14,950 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:11:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -197451106, now seen corresponding path program 9 times [2022-11-03 02:11:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925452939] [2022-11-03 02:11:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:14,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:11:14,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008162591] [2022-11-03 02:11:14,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:11:14,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:14,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:14,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:14,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:11:15,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:11:15,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:11:15,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:11:15,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:15,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:15,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:11:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925452939] [2022-11-03 02:11:15,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:11:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008162591] [2022-11-03 02:11:15,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008162591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44936195] [2022-11-03 02:11:15,282 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:11:15,283 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:11:15,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:11:15,283 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:11:15,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:11:15,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,334 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:11:15,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:11:15,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,450 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:11:15,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:11:15,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,560 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:11:15,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:11:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:11:15,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:15,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:15,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:15,795 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:11:15,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:11:15,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:11:15,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:16,020 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:11:16,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:11:16,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:11:16,090 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:11:16,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:11:16,206 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:16,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:11:16,289 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:11:16,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:11:16,327 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:11:16,807 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1193#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:11:16,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:11:16,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:11:16,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-03 02:11:16,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758143386] [2022-11-03 02:11:16,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:16,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:11:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:11:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:11:16,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:11:16,809 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:17,015 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-11-03 02:11:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:11:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:11:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:17,016 INFO L225 Difference]: With dead ends: 18 [2022-11-03 02:11:17,016 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 02:11:17,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:11:17,017 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:17,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:11:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 02:11:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 02:11:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-11-03 02:11:17,023 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2022-11-03 02:11:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:17,023 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-03 02:11:17,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-11-03 02:11:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:11:17,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:17,024 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:17,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:17,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:11:17,225 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:11:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1825908407, now seen corresponding path program 10 times [2022-11-03 02:11:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:11:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358211562] [2022-11-03 02:11:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:11:17,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:11:17,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152743523] [2022-11-03 02:11:17,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:11:17,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:17,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:17,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:17,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:11:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:17,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-03 02:11:17,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:17,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:11:17,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:11:17,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:11:17,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 02:11:17,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:11:17,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 02:11:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-03 02:11:17,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 116 [2022-11-03 02:11:17,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:11:17,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:17,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 113 [2022-11-03 02:11:17,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 27 [2022-11-03 02:11:18,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:18,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-11-03 02:11:18,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 28 [2022-11-03 02:11:18,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 02:11:18,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2022-11-03 02:11:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:18,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:18,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:11:18,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (* c_~N~0 2)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= 2 .cse5))) (and (or .cse0 (and (forall ((v_ArrVal_517 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select v_ArrVal_517 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2)))) (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (= .cse2 (+ .cse3 .cse4 .cse5)) (= .cse4 2))))) (not .cse0)))))) is different from false [2022-11-03 02:11:18,742 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (* c_~N~0 2)) (.cse3 (+ .cse14 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse11)) (.cse7 (and (forall ((v_ArrVal_517 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select v_ArrVal_517 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse4)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 2)))) (.cse5 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (let ((.cse1 (select v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1 .cse2)) .cse4) (not (= 2 .cse2))))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 2) (not (= 2 .cse6))))) (or (forall ((v_ArrVal_515 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) .cse7))) (or (not .cse0) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse8 (= .cse10 2))) (and (or .cse8 .cse7) (or (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (and (= .cse4 (+ .cse9 .cse10 .cse11 .cse12)) (= 2 .cse12))) (not .cse8)))))))))))) is different from false [2022-11-03 02:11:21,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse12 (+ .cse22 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* c_~N~0 2))) (let ((.cse3 (and (forall ((v_ArrVal_517 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (forall ((v_ArrVal_517 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) (select v_ArrVal_517 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse5)))) (.cse13 (+ .cse22 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse9)) (.cse2 (and (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= .cse5 (let ((.cse24 (select v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse24))) (not (= .cse23 2))))) (or .cse3 (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) 2))) (forall ((v_ArrVal_515 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 (select v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (not (= .cse25 2))))))) (.cse14 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (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 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse1 (= .cse8 2))) (and (or .cse1 .cse2) (or (not .cse1) (let ((.cse10 (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 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse4 (= 2 .cse10))) (and (or .cse3 .cse4) (or (not .cse4) (let ((.cse6 (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 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (and (= .cse5 (+ .cse6 .cse7 .cse8 .cse9 .cse10)) (= .cse6 2)))))))))))))) (or .cse0 (and (forall ((v_ArrVal_512 (Array Int Int))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse16 (select v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= .cse5 (+ .cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse16 .cse17)) (not (= .cse15 2)) (not (= 2 .cse17)))))) (forall ((v_ArrVal_512 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse19 (select v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (not (= .cse18 2)) (not (= 2 .cse20)))))) (or (forall ((v_ArrVal_512 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) 2)) .cse2) (or .cse3 (forall ((v_ArrVal_512 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 (select v_ArrVal_512 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (not (= .cse21 2))))))))))))) is different from false [2022-11-03 02:12:19,412 WARN L234 SmtUtils]: Spent 55.37s on a formula simplification. DAG size of input: 120 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:12:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 02:12:23,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:23,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358211562] [2022-11-03 02:12:23,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:23,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152743523] [2022-11-03 02:12:23,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152743523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573676512] [2022-11-03 02:12:23,490 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:12:23,490 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:23,491 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:23,491 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:23,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:23,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:23,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:23,673 INFO L244 Elim1Store]: Index analysis took 129 ms [2022-11-03 02:12:24,223 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:12:24,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:12:24,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:24,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:24,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:24,883 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:12:24,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:12:24,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:24,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:12:24,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:24,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:12:25,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:25,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:25,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:25,733 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:12:25,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:12:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:12:25,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:26,203 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:12:26,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:12:26,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:26,480 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:12:26,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:12:26,959 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:26,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:12:27,538 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:27,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:12:27,585 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:32,089 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1363#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:12:32,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:32,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:32,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-11-03 02:12:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277148787] [2022-11-03 02:12:32,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:32,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:12:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:12:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=490, Unknown=3, NotChecked=138, Total=702 [2022-11-03 02:12:32,092 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:35,011 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-11-03 02:12:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:12:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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 14 [2022-11-03 02:12:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:35,013 INFO L225 Difference]: With dead ends: 24 [2022-11-03 02:12:35,013 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:12:35,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=83, Invalid=576, Unknown=3, NotChecked=150, Total=812 [2022-11-03 02:12:35,014 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:35,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 54 Unchecked, 1.3s Time] [2022-11-03 02:12:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:12:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-11-03 02:12:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-03 02:12:35,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-11-03 02:12:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:35,025 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-03 02:12:35,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-03 02:12:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:12:35,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:35,026 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:35,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:35,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:35,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -768477186, now seen corresponding path program 11 times [2022-11-03 02:12:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:35,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144064078] [2022-11-03 02:12:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:35,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:35,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482010658] [2022-11-03 02:12:35,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:12:35,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:35,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:35,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:12:35,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:12:35,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:12:35,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:12:35,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:36,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:37,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144064078] [2022-11-03 02:12:37,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482010658] [2022-11-03 02:12:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482010658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559951951] [2022-11-03 02:12:37,303 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:12:37,303 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:37,303 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:37,303 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:37,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:37,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:37,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:37,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:37,958 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:12:37,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:12:38,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:12:38,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:12:38,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:12:38,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:38,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:38,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:38,813 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:12:38,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:12:38,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:12:39,208 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:12:39,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:12:39,507 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:12:39,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:12:39,943 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:39,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:12:40,431 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:40,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:12:40,483 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:43,869 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1543#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:12:43,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:43,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:43,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-11-03 02:12:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467163494] [2022-11-03 02:12:43,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:43,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:12:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:12:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:12:43,872 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:45,108 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-11-03 02:12:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:12:45,115 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:12:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:45,118 INFO L225 Difference]: With dead ends: 29 [2022-11-03 02:12:45,118 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:12:45,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:12:45,120 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:45,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:12:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:12:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2022-11-03 02:12:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-03 02:12:45,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2022-11-03 02:12:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:45,132 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-03 02:12:45,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-03 02:12:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:12:45,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:45,133 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:45,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:45,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:12:45,339 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1125314916, now seen corresponding path program 12 times [2022-11-03 02:12:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:45,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550029232] [2022-11-03 02:12:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:45,354 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:45,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205239077] [2022-11-03 02:12:45,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:12:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:45,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:45,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:12:45,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:12:45,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:12:45,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:12:45,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:46,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:47,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550029232] [2022-11-03 02:12:47,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205239077] [2022-11-03 02:12:47,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205239077] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620010245] [2022-11-03 02:12:47,533 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:12:47,533 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:47,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:47,534 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:47,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:47,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:47,743 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:12:47,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:12:47,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:47,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:47,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,415 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:12:48,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:12:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:12:48,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:12:48,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:12:48,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:48,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:49,200 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:12:49,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:12:49,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:12:49,594 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:12:49,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:12:49,887 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:12:49,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:12:50,308 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:50,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:12:50,728 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:12:50,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:12:50,810 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:53,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1735#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:12:53,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:53,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:53,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-11-03 02:12:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755028564] [2022-11-03 02:12:53,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:53,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:12:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:12:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:12:53,665 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:55,199 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-03 02:12:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:12:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:12:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:55,200 INFO L225 Difference]: With dead ends: 20 [2022-11-03 02:12:55,200 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:12:55,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:12:55,202 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:55,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:12:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:12:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:12:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-03 02:12:55,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-11-03 02:12:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:55,211 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-03 02:12:55,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-03 02:12:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:12:55,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:55,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:55,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:55,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:12:55,438 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -524915445, now seen corresponding path program 13 times [2022-11-03 02:12:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:55,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275787909] [2022-11-03 02:12:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:55,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:55,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134361103] [2022-11-03 02:12:55,469 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:12:55,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:55,471 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:55,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:12:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:55,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-03 02:12:55,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:55,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:12:55,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:12:55,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:12:56,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 02:12:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:12:56,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-03 02:12:56,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:56,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-03 02:12:57,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2022-11-03 02:12:57,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:12:58,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2022-11-03 02:12:58,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 31 [2022-11-03 02:12:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:58,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 139 [2022-11-03 02:12:58,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 42 [2022-11-03 02:12:58,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 70 [2022-11-03 02:12:59,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2022-11-03 02:12:59,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 52 [2022-11-03 02:13:00,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:00,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112 [2022-11-03 02:13:00,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 37 [2022-11-03 02:13:00,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 53 [2022-11-03 02:13:00,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 44 [2022-11-03 02:13:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:00,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:01,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:13:01,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (* c_~N~0 2)) (.cse2 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= 2 .cse5))) (and (or .cse0 (and (forall ((v_ArrVal_756 (Array Int Int))) (= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select v_ArrVal_756 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_756 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (and (= .cse1 (+ .cse3 .cse4 .cse5)) (= .cse4 2))))) (not .cse0)))))) is different from false [2022-11-03 02:13:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:13:25,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275787909] [2022-11-03 02:13:25,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:13:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134361103] [2022-11-03 02:13:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134361103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [591070816] [2022-11-03 02:13:25,991 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:13:25,992 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:13:25,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:13:25,992 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:13:25,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:13:26,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,640 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:13:26,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:13:26,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:13:26,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:13:26,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:13:26,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:26,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:27,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:27,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:27,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:27,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:27,363 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:13:27,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:13:27,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:13:27,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:27,749 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:13:27,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:13:27,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:28,021 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:13:28,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:13:28,431 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:28,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:13:28,893 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:28,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:13:28,961 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:13:34,747 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1931#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:13:34,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:13:34,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:13:34,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-11-03 02:13:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656709013] [2022-11-03 02:13:34,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:34,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:13:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:34,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:13:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=776, Unknown=13, NotChecked=56, Total=930 [2022-11-03 02:13:34,750 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:36,851 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-03 02:13:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:13:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 16 [2022-11-03 02:13:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:36,852 INFO L225 Difference]: With dead ends: 27 [2022-11-03 02:13:36,853 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:13:36,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=85, Invalid=776, Unknown=13, NotChecked=56, Total=930 [2022-11-03 02:13:36,854 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:36,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 58 Unchecked, 2.0s Time] [2022-11-03 02:13:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:13:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-11-03 02:13:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-03 02:13:36,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-11-03 02:13:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:36,865 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-03 02:13:36,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-03 02:13:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:13:36,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:36,866 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:36,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:37,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:13:37,067 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 907598972, now seen corresponding path program 14 times [2022-11-03 02:13:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:37,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526276623] [2022-11-03 02:13:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:37,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:13:37,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555558225] [2022-11-03 02:13:37,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:13:37,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:37,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:37,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:37,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:13:37,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:13:37,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:37,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:13:37,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:38,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:39,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526276623] [2022-11-03 02:13:39,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:13:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555558225] [2022-11-03 02:13:39,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555558225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:39,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901990789] [2022-11-03 02:13:39,672 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:13:39,673 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:13:39,673 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:13:39,673 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:13:39,673 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:13:39,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:39,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,312 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:13:40,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:13:40,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:13:40,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:13:40,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:13:40,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:40,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:40,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:41,096 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:13:41,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:13:41,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:13:41,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:41,537 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:13:41,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:13:41,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:41,808 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:13:41,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:13:42,232 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:42,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:13:42,626 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:42,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:13:42,678 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:13:46,206 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2131#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:13:46,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:13:46,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:13:46,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2022-11-03 02:13:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817485689] [2022-11-03 02:13:46,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:46,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:13:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:13:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:13:46,208 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:47,644 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-11-03 02:13:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:13:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:13:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:47,645 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:13:47,645 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 02:13:47,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:13:47,646 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:47,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:13:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 02:13:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-03 02:13:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-11-03 02:13:47,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-11-03 02:13:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:47,657 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-11-03 02:13:47,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-11-03 02:13:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:13:47,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:47,658 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:47,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:47,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:13:47,860 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1564436066, now seen corresponding path program 15 times [2022-11-03 02:13:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363116970] [2022-11-03 02:13:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:47,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:13:47,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909388941] [2022-11-03 02:13:47,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:13:47,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:47,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:47,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:47,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:13:48,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:13:48,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:48,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:13:48,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:49,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:50,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363116970] [2022-11-03 02:13:50,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:13:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909388941] [2022-11-03 02:13:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909388941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054798897] [2022-11-03 02:13:50,504 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:13:50,505 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:13:50,505 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:13:50,505 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:13:50,505 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:13:50,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:50,676 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:13:50,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:13:50,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,324 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:13:51,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:13:51,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:13:51,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:13:51,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:51,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:51,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:13:52,151 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:13:52,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:13:52,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:13:52,526 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:13:52,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:13:52,784 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:13:52,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:13:53,191 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:53,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:13:53,594 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:13:53,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:13:53,665 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:13:56,617 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2350#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:13:56,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:13:56,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:13:56,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-11-03 02:13:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725532490] [2022-11-03 02:13:56,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:56,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:13:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:13:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:13:56,619 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:58,353 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-03 02:13:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:13:58,354 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:13:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:58,354 INFO L225 Difference]: With dead ends: 22 [2022-11-03 02:13:58,354 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:13:58,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 02:13:58,356 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:58,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:13:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:13:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 02:13:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-03 02:13:58,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-11-03 02:13:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:58,368 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-03 02:13:58,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-03 02:13:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:13:58,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:58,369 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:58,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:13:58,570 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:58,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1252769207, now seen corresponding path program 16 times [2022-11-03 02:13:58,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:58,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758779333] [2022-11-03 02:13:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:58,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:13:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490824057] [2022-11-03 02:13:58,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:13:58,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:58,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:58,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:58,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:13:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:58,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-03 02:13:58,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:58,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:13:58,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:13:58,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:13:59,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:13:59,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2022-11-03 02:13:59,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:13:59,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-03 02:14:00,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 75 [2022-11-03 02:14:00,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:00,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-03 02:14:01,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:01,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:01,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:01,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2022-11-03 02:14:02,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 132 [2022-11-03 02:14:02,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-03 02:14:02,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 02:14:02,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:02,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:02,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:02,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:02,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2022-11-03 02:14:03,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2022-11-03 02:14:03,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:14:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:03,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:03,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:03,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:14:03,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2022-11-03 02:14:04,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2022-11-03 02:14:04,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 44 [2022-11-03 02:14:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:14:05,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:05,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:14:06,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (* c_~N~0 2)) (.cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= 2 .cse5))) (and (or .cse0 (and (forall ((v_ArrVal_1034 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_1034 (Array Int Int))) (= .cse2 (+ (select v_ArrVal_1034 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (= .cse2 (+ .cse3 .cse4 .cse5)) (= .cse4 2))))) (not .cse0)))))) is different from false [2022-11-03 02:14:23,265 WARN L234 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 76 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:15:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 02:15:25,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758779333] [2022-11-03 02:15:25,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:15:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490824057] [2022-11-03 02:15:25,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490824057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [782701280] [2022-11-03 02:15:25,303 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:15:25,303 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:25,303 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:25,304 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:25,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:25,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:25,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:25,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,027 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:15:26,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:15:26,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:15:26,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:15:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:15:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:26,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:26,911 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:15:26,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:15:27,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:15:27,316 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:15:27,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:15:27,566 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-03 02:15:27,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-03 02:15:27,967 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:15:27,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:15:28,357 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:15:28,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:15:28,399 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:37,317 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2572#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:15:37,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:37,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:15:37,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-03 02:15:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371469472] [2022-11-03 02:15:37,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:37,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:15:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:15:37,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1011, Unknown=18, NotChecked=64, Total=1190 [2022-11-03 02:15:37,319 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:54,437 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-11-03 02:15:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:15:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:15:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:54,438 INFO L225 Difference]: With dead ends: 30 [2022-11-03 02:15:54,438 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 02:15:54,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 91.8s TimeCoverageRelationStatistics Valid=108, Invalid=1138, Unknown=18, NotChecked=68, Total=1332 [2022-11-03 02:15:54,440 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:54,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 298 Invalid, 0 Unknown, 35 Unchecked, 5.3s Time] [2022-11-03 02:15:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 02:15:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-11-03 02:15:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-03 02:15:54,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2022-11-03 02:15:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:54,456 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-03 02:15:54,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-03 02:15:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:15:54,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:54,457 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:54,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:15:54,666 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -181031170, now seen corresponding path program 17 times [2022-11-03 02:15:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:54,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544622426] [2022-11-03 02:15:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:54,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:15:54,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485121494] [2022-11-03 02:15:54,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:15:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:54,699 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:54,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:15:55,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:15:55,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:55,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:15:55,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:57,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:58,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:58,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544622426] [2022-11-03 02:15:58,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:15:58,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485121494] [2022-11-03 02:15:58,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485121494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901233209] [2022-11-03 02:15:58,451 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:15:58,451 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:58,452 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:58,452 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:58,452 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:58,634 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:15:58,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:15:58,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:58,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,175 INFO L356 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-03 02:15:59,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-03 02:15:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,791 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:15:59,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:15:59,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-03 02:15:59,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,451 INFO L356 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-03 02:16:00,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-03 02:16:00,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:16:00,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,895 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:16:00,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:16:00,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,195 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:16:01,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:16:01,765 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:16:01,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:16:02,333 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:16:02,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:16:02,385 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:16:06,372 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2801#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:16:06,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:16:06,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:16:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-11-03 02:16:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138949682] [2022-11-03 02:16:06,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:16:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:16:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:16:06,375 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:08,179 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-03 02:16:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:16:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:16:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:08,182 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:16:08,182 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:16:08,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=268, Invalid=922, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:16:08,184 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:08,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:16:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:16:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-11-03 02:16:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-03 02:16:08,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2022-11-03 02:16:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:08,195 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-03 02:16:08,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-03 02:16:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:16:08,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:08,197 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:08,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:08,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:08,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash 495293980, now seen corresponding path program 18 times [2022-11-03 02:16:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:08,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42155301] [2022-11-03 02:16:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:08,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:16:08,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570605574] [2022-11-03 02:16:08,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:16:08,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:08,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:08,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:16:08,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:16:08,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:16:08,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:16:08,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:10,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:11,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42155301] [2022-11-03 02:16:11,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:16:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570605574] [2022-11-03 02:16:11,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570605574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393568992] [2022-11-03 02:16:11,706 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:16:11,707 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:16:11,707 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:16:11,707 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:16:11,707 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:16:11,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:11,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:11,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,355 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:16:12,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-03 02:16:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-03 02:16:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-03 02:16:12,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-03 02:16:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:13,163 INFO L356 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-03 02:16:13,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-03 02:16:13,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 02:16:13,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:13,579 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:16:13,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 02:16:13,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:13,880 INFO L356 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-03 02:16:13,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:16:14,388 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:16:14,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-03 02:16:14,970 INFO L356 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-03 02:16:14,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-03 02:16:15,019 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:16:18,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3047#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (ite (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem13#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-03 02:16:18,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:16:18,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:16:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-11-03 02:16:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678860373] [2022-11-03 02:16:18,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:18,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:16:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:16:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:16:18,059 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:20,461 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-03 02:16:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:16:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:16:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:20,462 INFO L225 Difference]: With dead ends: 24 [2022-11-03 02:16:20,463 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:16:20,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:16:20,464 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:20,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:16:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:16:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 02:16:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-11-03 02:16:20,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2022-11-03 02:16:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:20,478 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-11-03 02:16:20,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-11-03 02:16:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:16:20,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:20,479 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:20,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:20,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:20,682 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1825647221, now seen corresponding path program 19 times [2022-11-03 02:16:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:20,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628461153] [2022-11-03 02:16:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:20,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:16:20,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664604489] [2022-11-03 02:16:20,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:16:20,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:20,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:20,700 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:20,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:16:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:20,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-03 02:16:20,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:20,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:16:20,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:16:21,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:16:21,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 02:16:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:16:21,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:21,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-03 02:16:22,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2022-11-03 02:16:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:22,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-03 02:16:23,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:23,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 02:16:24,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2022-11-03 02:16:24,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:16:24,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:24,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2022-11-03 02:16:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:25,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 97 [2022-11-03 02:16:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:26,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 97 [2022-11-03 02:16:26,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 152 [2022-11-03 02:16:26,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 48 [2022-11-03 02:16:26,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 79 [2022-11-03 02:16:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:27,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2022-11-03 02:16:28,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 86 [2022-11-03 02:16:28,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 50 [2022-11-03 02:16:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:29,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:29,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 02:16:30,183 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (= 2 .cse3)) (.cse5 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* c_~N~0 2))) (and (or (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (and (= .cse0 (+ .cse1 .cse2 .cse3)) (= .cse2 2))))) (not .cse6)) (or .cse6 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2)) (forall ((v_ArrVal_1354 (Array Int Int))) (= (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse0)))))))) is different from false [2022-11-03 02:16:30,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (* c_~N~0 2)) (.cse9 (+ .cse14 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse6)) (.cse1 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse3 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))) (.cse10 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse2 (= .cse5 2))) (and (or .cse1 .cse2) (or (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (and (= .cse3 (+ .cse4 .cse5 .cse6 .cse7)) (= 2 .cse7))) (not .cse2)))))))) (or .cse0 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse3 (let ((.cse12 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse12))) (not (= 2 .cse11))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (not (= 2 .cse13))))) (or .cse1 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))))) is different from false [2022-11-03 02:16:34,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (* c_~N~0 2)) (.cse4 (+ .cse22 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) .cse8)) (forall ((v_ArrVal_1354 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2)))) (.cse5 (+ .cse22 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse18)) (.cse13 (and (or (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) .cse11) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2) (not (= 2 .cse23))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse8 (let ((.cse25 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse24 .cse25))) (not (= 2 .cse24))))))) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse3 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse1 2)) (not (= 2 .cse2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse10 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse7 2)) (= .cse8 (+ .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse9 .cse10)) (not (= 2 .cse9)))))) (or .cse11 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse12 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (or .cse13 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2))))) (or (not .cse0) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse21 (= .cse17 2))) (and (or (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse14 (= 2 .cse19))) (and (or .cse11 .cse14) (or (not .cse14) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (and (= .cse8 (+ .cse15 .cse16 .cse17 .cse18 .cse19)) (= .cse15 2))))))) (not .cse21)) (or .cse13 .cse21)))))))))))) is different from false [2022-11-03 02:16:38,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse17 (* c_~N~0 2)) (.cse10 (+ .cse31 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse17 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))) (.cse11 (+ .cse31 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= .cse17 (let ((.cse40 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse39 .cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))) (not (= 2 .cse39))))) (or .cse15 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= 2 .cse41)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))))) (.cse4 (+ .cse31 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse27)) (.cse2 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse34 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= 2 .cse32)) (= .cse17 (+ .cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse32 .cse34)) (not (= .cse33 2)))))) (or .cse15 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= 2 .cse35)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11) 2))))) (or .cse5 (forall ((v_ArrVal_1349 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse38 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2) (not (= 2 .cse37)) (not (= .cse36 2)))))))) (.cse1 (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2)) .cse2) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse3 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2)))) .cse5) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse8 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= .cse6 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2) (not (= .cse7 2)) (not (= .cse9 2))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse13 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= .cse12 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11) 2) (not (= .cse14 2)))))) .cse15) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse19 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= .cse16 2)) (= .cse17 (+ .cse18 .cse16 .cse19 .cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (not (= .cse18 2)) (not (= .cse20 2))))))))) (or (not .cse0) (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse30 (= .cse26 2))) (and (or (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse21 (= 2 .cse28))) (and (or .cse21 .cse5) (or (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse22 (= .cse23 2))) (and (or .cse15 .cse22) (or (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse25 .cse26 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (and (= (+ .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse17) (= .cse24 2))) (not .cse22))))) (not .cse21))))) (not .cse30)) (or .cse30 .cse2))))))))))))) is different from false [2022-11-03 02:16:47,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse41 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (* c_~N~0 2)) (.cse16 (+ .cse41 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse10 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))))) (.cse5 (+ .cse41 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (and (or .cse9 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse10 (let ((.cse62 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse61 .cse62))) (not (= 2 .cse61))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse63))))))) (.cse6 (+ .cse41 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse56 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse54 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse55)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse59 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse57 2)) (= .cse10 (+ .cse57 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse59)) (not (= 2 .cse58)))))) (or .cse9 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse60 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (or .cse23 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2))))) (.cse7 (+ .cse41 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse34)) (.cse17 (and (or .cse9 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse43 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= 2 .cse42)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2) (not (= 2 .cse44))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse47 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse45 2)) (not (= 2 .cse46)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse45 .cse48 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse48))))))) (or .cse28 (forall ((v_ArrVal_1345 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= 2 .cse49)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) .cse23) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse50 2)) (= .cse10 (+ .cse51 .cse50 .cse52 .cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse50 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (not (= 2 .cse53)) (not (= 2 .cse52))))))))) (.cse8 (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse3 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2) (not (= .cse2 2)) (not (= .cse1 2)) (not (= 2 .cse4))))))) .cse9) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse14 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse10 (+ .cse11 .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse13 .cse14 .cse15)) (not (= .cse11 2)) (not (= .cse13 2)) (not (= .cse12 2)) (not (= 2 .cse15)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2)) .cse17) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse21 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 2) (not (= .cse18 2)) (not (= .cse20 2)) (not (= .cse19 2)) (not (= 2 .cse22)))))))) (or .cse23 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse26 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (not (= .cse25 2)) (not (= .cse24 2))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 2) (not (= .cse27 2))))) .cse28))) (or (not .cse0) (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse40 (= .cse33 2))) (and (or (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse39 (= 2 .cse35))) (and (or (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse29 (= .cse30 2))) (and (or (not .cse29) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse38 (= .cse31 2))) (and (or (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (and (= (+ .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse10) (= 2 .cse36))) (not .cse38)) (or .cse9 .cse38))))) (or .cse23 .cse29)))) (not .cse39)) (or .cse39 .cse28)))) (not .cse40)) (or .cse17 .cse40)))))))))))))) is different from false [2022-11-03 02:16:49,814 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse41 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (* c_~N~0 2)) (.cse16 (+ .cse41 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse10 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))))) (.cse5 (+ .cse41 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (and (or .cse9 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse10 (let ((.cse62 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse61 .cse62))) (not (= 2 .cse61))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse63))))))) (.cse6 (+ .cse41 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse56 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse54 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse55)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse59 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse57 2)) (= .cse10 (+ .cse57 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse59)) (not (= 2 .cse58)))))) (or .cse9 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse60 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (or .cse23 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2))))) (.cse7 (+ .cse41 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse34)) (.cse17 (and (or .cse9 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse43 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= 2 .cse42)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2) (not (= 2 .cse44))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse47 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse45 2)) (not (= 2 .cse46)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse45 .cse48 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) (not (= 2 .cse48))))))) (or .cse28 (forall ((v_ArrVal_1345 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= 2 .cse49)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) .cse23) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse50 2)) (= .cse10 (+ .cse51 .cse50 .cse52 .cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse50 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (not (= 2 .cse53)) (not (= 2 .cse52))))))))) (.cse8 (+ .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse3 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2) (not (= .cse2 2)) (not (= .cse1 2)) (not (= 2 .cse4))))))) .cse9) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse14 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse10 (+ .cse11 .cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse13 .cse14 .cse15)) (not (= .cse11 2)) (not (= .cse13 2)) (not (= .cse12 2)) (not (= 2 .cse15)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2)) .cse17) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse21 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 2) (not (= .cse18 2)) (not (= .cse20 2)) (not (= .cse19 2)) (not (= 2 .cse22)))))))) (or .cse23 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse26 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (not (= .cse25 2)) (not (= .cse24 2))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 2) (not (= .cse27 2))))) .cse28))) (or (not .cse0) (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse40 (= .cse33 2))) (and (or (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse39 (= 2 .cse35))) (and (or (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse29 (= .cse30 2))) (and (or (not .cse29) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse38 (= .cse31 2))) (and (or (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (and (= (+ .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse10) (= 2 .cse36))) (not .cse38)) (or .cse9 .cse38))))) (or .cse23 .cse29)))) (not .cse39)) (or .cse39 .cse28)))) (not .cse40)) (or .cse17 .cse40)))))))))))))) is different from true [2022-11-03 02:17:02,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse52 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse9 (* c_~N~0 2)) (.cse19 (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse21 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse9 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))) (.cse22 (+ .cse52 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= (let ((.cse91 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse90 .cse91)) .cse9) (not (= 2 .cse90))))) (or (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) .cse21) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse92 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= 2 .cse92)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse92 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2)))))) (.cse23 (+ .cse52 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)) (.cse85 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse83 2)) (not (= .cse84 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))))) (or .cse8 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2))) (or .cse21 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse86 2)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)) (.cse89 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse87 2)) (= .cse9 (+ .cse87 .cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse89)) (not (= .cse88 2)))))))) (.cse24 (+ .cse52 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (and (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse74 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= .cse9 (+ .cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse72 .cse73 .cse74)) (not (= 2 .cse73)) (not (= .cse72 2)) (not (= 2 .cse74))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse75 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse76 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22)) (not (= 2 .cse77)) (not (= .cse76 2)))))) .cse21) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2) (not (= 2 .cse78))))) .cse8) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse82 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= 2 .cse79)) (not (= .cse80 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80 .cse79 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2) (not (= 2 .cse82))))))) (or .cse5 (forall ((v_ArrVal_1345 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24)))))) (.cse25 (+ .cse52 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse15)) (.cse1 (and (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse55 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse53 .cse54 .cse55 .cse56 .cse57) .cse9) (not (= .cse53 2)) (not (= 2 .cse56)) (not (= .cse54 2)) (not (= 2 .cse57)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse59 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse58 2)) (not (= 2 .cse60)) (not (= 2 .cse61))))))) .cse21) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse4) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse62 2)) (not (= 2 .cse63)) (not (= .cse64 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse64 .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2) (not (= 2 .cse66)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse69 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= 2 .cse67)) (not (= 2 .cse68)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2))))) .cse8) (or .cse5 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24)) (not (= 2 .cse70)))))))) (.cse26 (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse2 (= .cse13 2))) (and (or .cse1 .cse2) (or (not .cse2) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse3 (= 2 .cse16))) (and (or .cse3 .cse4) (or (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse6 (= .cse10 2))) (and (or .cse5 .cse6) (or (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse7 (= .cse11 2))) (and (or .cse7 .cse8) (or (not .cse7) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (let ((.cse20 (= 2 .cse17))) (and (or (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (and (= .cse9 (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (= .cse14 2))) (not .cse20)) (or .cse20 .cse21)))))))) (not .cse6))))) (not .cse3)))))))))))) (or .cse0 (and (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse30 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= 2 .cse27)) (not (= .cse28 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse28 .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2) (not (= .cse29 2))))))) .cse8) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse31 2)) (not (= 2 .cse32)) (not (= .cse33 2)) (= .cse9 (+ .cse31 .cse34 .cse35 .cse33 .cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34 .cse35 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse32)) (not (= .cse35 2)) (not (= .cse34 2))))))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse39 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (not (= 2 .cse37)) (not (= .cse38 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 2))))) .cse5) (or .cse1 (forall ((v_ArrVal_1340 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse45 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse40 2)) (not (= 2 .cse41)) (not (= .cse42 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse43 .cse44 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)) (not (= .cse44 2)) (not (= .cse43 2))))))))) (or .cse4 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (not (= 2 .cse46)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25) 2))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= 2 .cse47)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse50 2)) (not (= .cse49 2)) (not (= .cse48 2)))))))) .cse21))))))))))) is different from false [2022-11-03 02:17:05,030 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse52 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse9 (* c_~N~0 2)) (.cse19 (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse21 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse9 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))) (.cse22 (+ .cse52 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= (let ((.cse91 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse90 .cse91)) .cse9) (not (= 2 .cse90))))) (or (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) .cse21) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse92 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= 2 .cse92)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse92 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2)))))) (.cse23 (+ .cse52 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)) (.cse85 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse83 2)) (not (= .cse84 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))))) (or .cse8 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2))) (or .cse21 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse86 2)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)) (.cse89 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse87 2)) (= .cse9 (+ .cse87 .cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse89)) (not (= .cse88 2)))))))) (.cse24 (+ .cse52 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (and (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse74 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= .cse9 (+ .cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse72 .cse73 .cse74)) (not (= 2 .cse73)) (not (= .cse72 2)) (not (= 2 .cse74))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse75 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse76 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22)) (not (= 2 .cse77)) (not (= .cse76 2)))))) .cse21) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2) (not (= 2 .cse78))))) .cse8) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse82 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= 2 .cse79)) (not (= .cse80 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80 .cse79 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2) (not (= 2 .cse82))))))) (or .cse5 (forall ((v_ArrVal_1345 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24)))))) (.cse25 (+ .cse52 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= 2 .cse15)) (.cse1 (and (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse55 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse53 .cse54 .cse55 .cse56 .cse57) .cse9) (not (= .cse53 2)) (not (= 2 .cse56)) (not (= .cse54 2)) (not (= 2 .cse57)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse59 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse58 2)) (not (= 2 .cse60)) (not (= 2 .cse61))))))) .cse21) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse4) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse62 2)) (not (= 2 .cse63)) (not (= .cse64 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse64 .cse65 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2) (not (= 2 .cse66)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse69 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= 2 .cse67)) (not (= 2 .cse68)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2))))) .cse8) (or .cse5 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24)) (not (= 2 .cse70)))))))) (.cse26 (+ .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse2 (= .cse13 2))) (and (or .cse1 .cse2) (or (not .cse2) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse3 (= 2 .cse16))) (and (or .cse3 .cse4) (or (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse6 (= .cse10 2))) (and (or .cse5 .cse6) (or (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse7 (= .cse11 2))) (and (or .cse7 .cse8) (or (not .cse7) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (let ((.cse20 (= 2 .cse17))) (and (or (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (and (= .cse9 (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (= .cse14 2))) (not .cse20)) (or .cse20 .cse21)))))))) (not .cse6))))) (not .cse3)))))))))))) (or .cse0 (and (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse30 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= 2 .cse27)) (not (= .cse28 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse28 .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 2) (not (= .cse29 2))))))) .cse8) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse31 2)) (not (= 2 .cse32)) (not (= .cse33 2)) (= .cse9 (+ .cse31 .cse34 .cse35 .cse33 .cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34 .cse35 .cse33 .cse36 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse32)) (not (= .cse35 2)) (not (= .cse34 2))))))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse39 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (not (= 2 .cse37)) (not (= .cse38 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 2))))) .cse5) (or .cse1 (forall ((v_ArrVal_1340 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse45 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22))) (or (not (= .cse40 2)) (not (= 2 .cse41)) (not (= .cse42 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse43 .cse44 .cse42 .cse45 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)) (not (= .cse44 2)) (not (= .cse43 2))))))))) (or .cse4 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (not (= 2 .cse46)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25) 2))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= 2 .cse47)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse51 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse22) 2) (not (= .cse50 2)) (not (= .cse49 2)) (not (= .cse48 2)))))))) .cse21))))))))))) is different from true [2022-11-03 02:17:18,721 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse27 (* c_~N~0 2)) (.cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse30 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (forall ((v_ArrVal_1354 (Array Int Int))) (= .cse27 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))))) (.cse20 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse89 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2)))) (or .cse30 (forall ((v_ArrVal_1351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 2))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= .cse27 (let ((.cse91 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse91))) (not (= .cse90 2))))))) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (and (or .cse30 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse82 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 2) (not (= 2 .cse82)))))) (or (forall ((v_ArrVal_1349 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) .cse8) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse85 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse83 2)) (= .cse27 (+ .cse83 .cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse85)) (not (= 2 .cse84)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse87 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse88 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse86 2)) (not (= 2 .cse87)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))))))) (.cse5 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (and (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= .cse27 (+ .cse70 .cse71 .cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse73)) (not (= .cse72 2)) (not (= 2 .cse73)) (not (= .cse70 2))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2)) .cse12) (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse74 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse74 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) .cse8) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)) (not (= .cse77 2)) (not (= 2 .cse78)) (not (= .cse75 2))))))) (or .cse30 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse79 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse81 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 2) (not (= .cse80 2)) (not (= 2 .cse81))))))))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (= 2 .cse50)) (.cse36 (and (or .cse30 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse55 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= .cse52 2)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse54 2)) (not (= .cse53 2)))))))) (or .cse8 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse58 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse56 2)) (not (= .cse57 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2)))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2)) .cse29) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse62 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse59 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse63 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse59 .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse59 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse59 .cse61 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 2) (not (= .cse61 2)) (not (= .cse60 2)) (not (= 2 .cse63)))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse67 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse65 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse64 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse64 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse64 2)) (= .cse27 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse64 .cse66 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse65 .cse64 .cse66 .cse67 .cse68)) (not (= .cse66 2)) (not (= .cse65 2)) (not (= 2 .cse68)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse69 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 2)))) .cse12))) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (and (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= 2 .cse2)) (not (= .cse0 2)) (not (= 2 .cse3))))))) .cse8) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse10 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= .cse9 2)) (not (= 2 .cse11)))))) .cse12) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse16 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse13 .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= 2 .cse13)) (not (= 2 .cse14)) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17 .cse13 .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)) (not (= .cse15 2)) (not (= 2 .cse18)) (not (= 2 .cse17))))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse22 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= (+ .cse21 .cse22 .cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse24 .cse25 .cse26) .cse27) (not (= 2 .cse24)) (not (= 2 .cse25)) (not (= .cse21 2)) (not (= 2 .cse26)) (not (= 2 .cse23))))))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2) (not (= 2 .cse28))))) .cse29) (or .cse30 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= 2 .cse33)) (not (= 2 .cse34)) (not (= .cse31 2)) (not (= 2 .cse35))))))))) (or .cse36 (forall ((v_ArrVal_1340 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) .cse37) (or (not .cse37) (let ((.cse51 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse38 (= 2 .cse49))) (and (or .cse38 .cse36) (or (not .cse38) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse39 (= .cse46 2))) (and (or .cse29 .cse39) (or (not .cse39) (let ((.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse40 (= 2 .cse47))) (and (or .cse40 .cse12) (or (not .cse40) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse41 (= 2 .cse48))) (and (or (not .cse41) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47 .cse48 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse42 (= .cse45 2))) (and (or (not .cse42) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (and (= (+ .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) .cse27) (= .cse43 2)))) (or .cse30 .cse42))))) (or .cse41 .cse8)))))))))))))))))))))))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) is different from true [2022-11-03 02:17:53,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse84 (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|) 2)) (.cse116 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (+ .cse116 1)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse84)) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse45 (+ .cse116 3))) (let ((.cse8 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (forall ((v_ArrVal_1354 (Array Int Int))) (< .cse14 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))) (forall ((v_ArrVal_1354 (Array Int Int))) (< (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse45))))) (let ((.cse34 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse111 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse111)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse112 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse112)) (< (let ((.cse113 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse112 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse113)) .cse45)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse114 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse114)) (< .cse14 (let ((.cse115 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse114 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse115)))))) (or (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) .cse1))) (.cse9 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse101 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse103 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse102 2)) (not (= .cse101 2)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse104 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse106 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (< .cse14 (+ .cse104 .cse105 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse105 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse106)) (not (= .cse105 2)) (not (= .cse104 2)))))) (or (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse107 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse107 2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2)))) .cse1) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse108 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse110 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (< (+ .cse108 .cse109 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse110) .cse45) (not (= .cse109 2)) (not (= .cse108 2)))))) (or .cse34 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 2)))))) (let ((.cse21 (and (or .cse34 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse85 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse85 2)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse88 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse86 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse87 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse89 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse86 2)) (not (= 2 .cse87)) (< (+ .cse88 .cse86 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86 .cse87 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse87 .cse89) .cse45) (not (= 2 .cse89))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse91 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse90 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse92 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse93 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse90 2)) (< .cse14 (+ .cse91 .cse90 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse92 .cse93)) (not (= 2 .cse92)) (not (= 2 .cse93))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse94 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse95 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse96 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse97 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse95 2)) (not (= 2 .cse96)) (not (= 2 .cse97))))))) (or .cse1 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse98 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse99 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse100 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse99 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (not (= .cse99 2)) (not (= 2 .cse100))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2)) .cse38))) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (= .cse51 2)) (.cse23 (and (or .cse38 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse61 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2) (not (= 2 .cse61)))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse63 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse64 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse62 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse62)) (not (= .cse63 2)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse62 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse64 2)) (not (= 2 .cse66)))))))) (or .cse1 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse69 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse70 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse67 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse68 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (not (= .cse67 2)) (not (= .cse68 2)) (not (= 2 .cse70)))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse74 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse75 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse72 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse73 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse71 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse71)) (not (= .cse72 2)) (< .cse14 (+ .cse72 .cse73 .cse71 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse71 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse74 .cse75)) (not (= .cse73 2)) (not (= 2 .cse75)))))))) (or .cse21 (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)))) (or .cse34 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse78 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse76 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse76 2)) (not (= 2 .cse77)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 2)))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse83 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse80 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse81 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse79 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse79)) (not (= .cse80 2)) (< (+ .cse80 .cse81 .cse79 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse79 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse82 .cse83) .cse45) (not (= .cse81 2)) (not (= 2 .cse83)))))))))) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse4 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= 2 .cse2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2) (not (= 2 .cse6)) (not (= 2 .cse7)) (not (= 2 .cse5))))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse13 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse16 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse19 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse17 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse13)) (< .cse14 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse13 .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse15 .cse13 .cse16 .cse17 .cse18 .cse19)) (not (= .cse15 2)) (not (= 2 .cse18)) (not (= 2 .cse19)) (not (= 2 .cse17))))))))) (or .cse21 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse22 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (not (= 2 .cse22)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)))))) (or .cse23 (forall ((v_ArrVal_1340 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse24 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse26 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse29 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse27 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse24)) (not (= .cse25 2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse24 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 2) (not (= 2 .cse28)) (not (= 2 .cse29)) (not (= 2 .cse27))))))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse30 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse33 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse32 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= 2 .cse30)) (not (= 2 .cse31)) (not (= 2 .cse32)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))) .cse34) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse35 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= 2 .cse35)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (not (= 2 .cse37)))))) .cse38) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse39 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse41 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse44 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse42 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse40 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse39)) (not (= .cse40 2)) (< (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse39 .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse40 .cse39 .cse41 .cse42 .cse43 .cse44) .cse45) (not (= 2 .cse43)) (not (= 2 .cse44)) (not (= 2 .cse42))))))))))) (or (not .cse0) (let ((.cse58 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse46 (= .cse55 2))) (and (or (not .cse46) (let ((.cse52 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse47 (= .cse52 2))) (and (or .cse21 .cse47) (or (not .cse47) (let ((.cse57 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse60 (= 2 .cse57))) (and (or (let ((.cse54 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse48 (= .cse54 2))) (and (or .cse34 .cse48) (or (let ((.cse53 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse59 (= .cse53 2))) (and (or (let ((.cse49 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse50 (+ .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse49 .cse57))) (and (= 2 .cse49) (< .cse50 .cse45) (< .cse14 .cse50)))) (not .cse59)) (or .cse1 .cse59)))) (not .cse48))))) (not .cse60)) (or .cse38 .cse60))))))))) (or .cse23 .cse46))))))))))))))) is different from false [2022-11-03 02:17:56,016 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse84 (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|) 2)) (.cse116 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (+ .cse116 1)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse84)) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse45 (+ .cse116 3))) (let ((.cse8 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (and (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (forall ((v_ArrVal_1354 (Array Int Int))) (< .cse14 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))) (forall ((v_ArrVal_1354 (Array Int Int))) (< (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse45))))) (let ((.cse34 (and (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse111 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse111)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse112 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse112)) (< (let ((.cse113 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse112 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse113)) .cse45)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse114 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse114)) (< .cse14 (let ((.cse115 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse114 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse115)))))) (or (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) .cse1))) (.cse9 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse101 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse103 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse102 2)) (not (= .cse101 2)))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse104 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse106 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (< .cse14 (+ .cse104 .cse105 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse105 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse106)) (not (= .cse105 2)) (not (= .cse104 2)))))) (or (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse107 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse107 2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2)))) .cse1) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse108 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (.cse110 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (< (+ .cse108 .cse109 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse110) .cse45) (not (= .cse109 2)) (not (= .cse108 2)))))) (or .cse34 (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 2)))))) (let ((.cse21 (and (or .cse34 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse85 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse85 2)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse88 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse86 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse87 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse89 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse86 2)) (not (= 2 .cse87)) (< (+ .cse88 .cse86 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse86 .cse87 .cse89))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse87 .cse89) .cse45) (not (= 2 .cse89))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse91 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse90 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse92 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse93 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse90 2)) (< .cse14 (+ .cse91 .cse90 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse91 .cse90 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse92 .cse93)) (not (= 2 .cse92)) (not (= 2 .cse93))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse94 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse95 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse96 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse97 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse95 .cse96 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse95 2)) (not (= 2 .cse96)) (not (= 2 .cse97))))))) (or .cse1 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse98 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse99 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse100 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse98 .cse99 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (not (= .cse99 2)) (not (= 2 .cse100))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2)) .cse38))) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (= .cse51 2)) (.cse23 (and (or .cse38 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse61 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 2) (not (= 2 .cse61)))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse63 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse64 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse62 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse62)) (not (= .cse63 2)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse62 .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse64 2)) (not (= 2 .cse66)))))))) (or .cse1 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse69 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse70 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse67 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse68 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (not (= .cse67 2)) (not (= .cse68 2)) (not (= 2 .cse70)))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse74 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse75 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse72 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse73 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse71 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse71)) (not (= .cse72 2)) (< .cse14 (+ .cse72 .cse73 .cse71 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse73 .cse71 .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse74 .cse75)) (not (= .cse73 2)) (not (= 2 .cse75)))))))) (or .cse21 (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)))) (or .cse34 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse78 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse76 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse76 2)) (not (= 2 .cse77)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 2)))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse83 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse80 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse81 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse79 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse79)) (not (= .cse80 2)) (< (+ .cse80 .cse81 .cse79 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse79 .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse82 .cse83) .cse45) (not (= .cse81 2)) (not (= 2 .cse83)))))))))) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse4 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= 2 .cse2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2) (not (= 2 .cse6)) (not (= 2 .cse7)) (not (= 2 .cse5))))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse13 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse16 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse19 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse17 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse13)) (< .cse14 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse13 .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse15 .cse13 .cse16 .cse17 .cse18 .cse19)) (not (= .cse15 2)) (not (= 2 .cse18)) (not (= 2 .cse19)) (not (= 2 .cse17))))))))) (or .cse21 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse22 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (not (= 2 .cse22)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)))))) (or .cse23 (forall ((v_ArrVal_1340 (Array Int Int))) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse24 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse26 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse29 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse27 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse24)) (not (= .cse25 2)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse24 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 2) (not (= 2 .cse28)) (not (= 2 .cse29)) (not (= 2 .cse27))))))))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse30 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse33 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse32 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= 2 .cse30)) (not (= 2 .cse31)) (not (= 2 .cse32)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))) .cse34) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse35 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (not (= 2 .cse35)) (= 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (not (= 2 .cse37)))))) .cse38) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse39 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (.cse41 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse44 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse42 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse40 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= 2 .cse39)) (not (= .cse40 2)) (< (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse39 .cse41 .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse40 .cse39 .cse41 .cse42 .cse43 .cse44) .cse45) (not (= 2 .cse43)) (not (= 2 .cse44)) (not (= 2 .cse42))))))))))) (or (not .cse0) (let ((.cse58 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse46 (= .cse55 2))) (and (or (not .cse46) (let ((.cse52 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse47 (= .cse52 2))) (and (or .cse21 .cse47) (or (not .cse47) (let ((.cse57 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse60 (= 2 .cse57))) (and (or (let ((.cse54 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse48 (= .cse54 2))) (and (or .cse34 .cse48) (or (let ((.cse53 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse59 (= .cse53 2))) (and (or (let ((.cse49 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse50 (+ .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse49 .cse57))) (and (= 2 .cse49) (< .cse50 .cse45) (< .cse14 .cse50)))) (not .cse59)) (or .cse1 .cse59)))) (not .cse48))))) (not .cse60)) (or .cse38 .cse60))))))))) (or .cse23 .cse46))))))))))))))) is different from true [2022-11-03 02:19:17,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse100 (let ((.cse117 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 2))) (.cse116 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse28 (+ .cse116 3)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse100)) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse38 (+ .cse116 5))) (let ((.cse39 (and (forall ((v_ArrVal_1354 (Array Int Int))) (< .cse28 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (forall ((v_ArrVal_1354 (Array Int Int))) (< (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38)))) (.cse21 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (and (or .cse39 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse111 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse111)) (< .cse28 (let ((.cse112 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse111 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 .cse112))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse112)))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse113 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse113)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse114 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (< (let ((.cse115 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse114 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse115)) .cse38) (not (= 2 .cse114)))))))) (let ((.cse4 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse101 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse103 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse101 2)) (not (= .cse102 2)) (< (+ .cse102 .cse101 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse103) .cse38))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse104 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse106 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse104 2)) (not (= .cse105 2)) (< .cse28 (+ .cse105 .cse104 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse105 .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse106)))))) (or .cse39 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse107 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (not (= .cse107 2)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 2))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse108 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse110 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse108 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse109 .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse109 2)))))) (or (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) 2)) .cse8)))) (let ((.cse52 (select .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (and (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse84 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (not (= .cse84 2))))) .cse8) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse86 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse87 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse88 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse85 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse85)) (< (+ .cse86 .cse87 .cse88 .cse85 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38) (not (= .cse87 2)) (not (= 2 .cse88))))))) (or .cse39 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse89 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse90 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse91 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= .cse90 2)) (not (= 2 .cse91))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse93 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse95 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse92 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse92)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse94 2)) (not (= 2 .cse95))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse97 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse98 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse99 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse96 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse96)) (< .cse28 (+ .cse97 .cse98 .cse99 .cse96 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98 .cse99 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (not (= .cse98 2)) (not (= 2 .cse99))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2)) .cse7)))) (let ((.cse22 (and (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse62 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse63 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse65 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse64 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse61)) (< .cse28 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse62 .cse61 .cse63 .cse64 .cse65)) (not (= 2 .cse65)) (not (= 2 .cse63)) (not (= 2 .cse64)))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse70 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse68 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse67 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse69 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse66)) (not (= 2 .cse67)) (not (= 2 .cse68)) (not (= 2 .cse69)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68 .cse69 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse72 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse73 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse74 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= 2 .cse72)) (not (= 2 .cse74)) (not (= 2 .cse73))))))) .cse39) (or .cse8 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse75 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse77 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= 2 .cse75)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (not (= 2 .cse77))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse80 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse79 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse81 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse78)) (not (= 2 .cse79)) (not (= 2 .cse80)) (not (= 2 .cse81)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80 .cse81 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse82 .cse78 .cse80 .cse81 .cse79) .cse38))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse83 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= 2 .cse83))))) .cse7) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) .cse24))) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse45 (= .cse52 2))) (and (or (and (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse3 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= 2 .cse0)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= .cse2 2)))))) .cse7) (or .cse8 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse10 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse11 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse12 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= 2 .cse9)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) 2) (not (= 2 .cse12)) (not (= .cse10 2)))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse16 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse17 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse18 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse15 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse19 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse15 .cse14 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse14)) (not (= .cse15 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse15 .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= 2 .cse19)) (not (= 2 .cse18)) (not (= .cse16 2))))))))) (or .cse22 (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse23 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= .cse23 2))))) .cse24) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse29 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse30 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse31 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse25 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse26 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse25 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse27 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse25 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse25)) (not (= .cse26 2)) (not (= 2 .cse27)) (< .cse28 (+ .cse29 .cse26 .cse25 .cse30 .cse31 .cse27 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse25 .cse30 .cse31 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (not (= 2 .cse31)) (not (= .cse29 2))))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse35 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse37 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse32 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse33 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse32 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse34 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse33 .cse32 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse32)) (not (= .cse33 2)) (not (= 2 .cse34)) (< (+ .cse35 .cse33 .cse32 .cse36 .cse37 .cse34 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse33 .cse32 .cse36 .cse37 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38) (not (= 2 .cse37)) (not (= .cse35 2))))))))) (or .cse39 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse42 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse43 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse44 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse41 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse40 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (not (= 2 .cse40)) (not (= .cse41 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse41 .cse40 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= 2 .cse44)) (not (= .cse42 2)))))))))) .cse45) (or (let ((.cse59 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse60 (= 2 .cse58))) (and (or (let ((.cse55 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse46 (= 2 .cse55))) (and (or (not .cse46) (let ((.cse57 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse47 (= 2 .cse57))) (and (or .cse47 .cse7) (or (not .cse47) (let ((.cse53 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse48 (= .cse53 2))) (and (or (not .cse48) (let ((.cse54 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse49 (= .cse54 2))) (and (or (not .cse49) (let ((.cse50 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse51 (+ .cse52 .cse50 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58))) (and (= .cse50 2) (< .cse51 .cse38) (< .cse28 .cse51))))) (or .cse39 .cse49))))) (or .cse8 .cse48))))))))) (or .cse46 .cse24)))) (not .cse60)) (or .cse22 .cse60)))))) (not .cse45)))))))))) is different from false [2022-11-03 02:19:19,756 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse100 (let ((.cse117 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (+ .cse117 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 2))) (.cse116 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse28 (+ .cse116 3)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse100)) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse38 (+ .cse116 5))) (let ((.cse39 (and (forall ((v_ArrVal_1354 (Array Int Int))) (< .cse28 (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))) (forall ((v_ArrVal_1354 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (forall ((v_ArrVal_1354 (Array Int Int))) (< (+ (select v_ArrVal_1354 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38)))) (.cse21 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (and (or .cse39 (forall ((v_ArrVal_1351 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse111 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse111)) (< .cse28 (let ((.cse112 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse111 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 .cse112))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse112)))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse113 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse113)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))))) (forall ((v_ArrVal_1351 (Array Int Int))) (let ((.cse114 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (< (let ((.cse115 (select v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse114 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1351 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse115)) .cse38) (not (= 2 .cse114)))))))) (let ((.cse4 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (and (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse101 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse103 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse102 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse101 2)) (not (= .cse102 2)) (< (+ .cse102 .cse101 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse102 .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse103) .cse38))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse104 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse106 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse104 2)) (not (= .cse105 2)) (< .cse28 (+ .cse105 .cse104 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse105 .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse106)))))) (or .cse39 (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse107 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (not (= .cse107 2)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 2))))) (forall ((v_ArrVal_1349 (Array Int Int))) (let ((.cse108 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (.cse110 (select v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse108 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1349 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse109 .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse109 2)))))) (or (forall ((v_ArrVal_1349 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) 2)) .cse8)))) (let ((.cse52 (select .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (and (or (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse84 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (not (= .cse84 2))))) .cse8) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse86 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse87 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse88 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse85 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse85)) (< (+ .cse86 .cse87 .cse88 .cse85 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38) (not (= .cse87 2)) (not (= 2 .cse88))))))) (or .cse39 (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse89 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse90 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse91 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= .cse90 2)) (not (= 2 .cse91))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse93 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse95 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse92 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse92)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= .cse94 2)) (not (= 2 .cse95))))))) (forall ((v_ArrVal_1345 (Array Int Int))) (let ((.cse97 (select v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse98 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse99 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse96 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse96)) (< .cse28 (+ .cse97 .cse98 .cse99 .cse96 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1345 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse97 .cse98 .cse99 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (not (= .cse98 2)) (not (= 2 .cse99))))))) (or (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 2)) .cse7)))) (let ((.cse22 (and (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse62 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse61 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse63 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse65 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse64 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse61)) (< .cse28 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse61 .cse63 .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse62 .cse61 .cse63 .cse64 .cse65)) (not (= 2 .cse65)) (not (= 2 .cse63)) (not (= 2 .cse64)))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse70 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse68 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse67 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse69 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse66)) (not (= 2 .cse67)) (not (= 2 .cse68)) (not (= 2 .cse69)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse66 .cse68 .cse69 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse72 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse73 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse74 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse71 .cse72 .cse73 .cse74))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= 2 .cse72)) (not (= 2 .cse74)) (not (= 2 .cse73))))))) .cse39) (or .cse8 (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse75 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse77 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= 2 .cse75)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (not (= 2 .cse77))))))) (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse80 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse79 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse81 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse78)) (not (= 2 .cse79)) (not (= 2 .cse80)) (not (= 2 .cse81)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse78 .cse80 .cse81 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) .cse82 .cse78 .cse80 .cse81 .cse79) .cse38))))))) (or (forall ((v_ArrVal_1342 (Array Int Int))) (let ((.cse83 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1342 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= 2 .cse83))))) .cse7) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) .cse24))) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse45 (= .cse52 2))) (and (or (and (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse3 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= 2 .cse0)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= .cse2 2)))))) .cse7) (or .cse8 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse10 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse11 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse12 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= 2 .cse9)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13) 2) (not (= 2 .cse12)) (not (= .cse10 2)))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse16 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse17 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse18 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse15 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse19 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse15 .cse14 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse14)) (not (= .cse15 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse15 .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) (not (= 2 .cse19)) (not (= 2 .cse18)) (not (= .cse16 2))))))))) (or .cse22 (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 2))) (or (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse23 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= .cse23 2))))) .cse24) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse29 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse30 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse31 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse25 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse26 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse25 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse27 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse25 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse25)) (not (= .cse26 2)) (not (= 2 .cse27)) (< .cse28 (+ .cse29 .cse26 .cse25 .cse30 .cse31 .cse27 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse26 .cse25 .cse30 .cse31 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (not (= 2 .cse31)) (not (= .cse29 2))))))))) (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse35 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse36 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse37 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse32 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse33 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse32 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse34 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse33 .cse32 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= 2 .cse32)) (not (= .cse33 2)) (not (= 2 .cse34)) (< (+ .cse35 .cse33 .cse32 .cse36 .cse37 .cse34 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse33 .cse32 .cse36 .cse37 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20)) .cse38) (not (= 2 .cse37)) (not (= .cse35 2))))))))) (or .cse39 (forall ((v_ArrVal_1340 (Array Int Int))) (let ((.cse42 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse43 (select v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse44 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse41 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse40 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (or (not (= 2 .cse40)) (not (= .cse41 2)) (= 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1340 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse41 .cse40 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)) (not (= 2 .cse44)) (not (= .cse42 2)))))))))) .cse45) (or (let ((.cse59 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse60 (= 2 .cse58))) (and (or (let ((.cse55 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse46 (= 2 .cse55))) (and (or (not .cse46) (let ((.cse57 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55 .cse56 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse47 (= 2 .cse57))) (and (or .cse47 .cse7) (or (not .cse47) (let ((.cse53 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse48 (= .cse53 2))) (and (or (not .cse48) (let ((.cse54 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse49 (= .cse54 2))) (and (or (not .cse49) (let ((.cse50 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse51 (+ .cse52 .cse50 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58))) (and (= .cse50 2) (< .cse51 .cse38) (< .cse28 .cse51))))) (or .cse39 .cse49))))) (or .cse8 .cse48))))))))) (or .cse46 .cse24)))) (not .cse60)) (or .cse22 .cse60)))))) (not .cse45)))))))))) is different from true [2022-11-03 02:21:55,155 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-03 02:21:55,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:55,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628461153] [2022-11-03 02:21:55,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:21:55,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664604489] [2022-11-03 02:21:55,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-03 02:21:55,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493196610] [2022-11-03 02:21:55,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-03 02:21:55,161 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:21:55,161 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:21:55,161 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:21:55,161 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:21:55,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:21:55,163 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:274) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-03 02:21:55,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:55,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2022-11-03 02:21:55,167 ERROR L170 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2022-11-03 02:21:55,167 INFO L359 BasicCegarLoop]: Counterexample might be feasible [2022-11-03 02:21:55,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:21:55,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:55,385 INFO L444 BasicCegarLoop]: Path program histogram: [19, 1, 1] [2022-11-03 02:21:55,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:21:55,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:21:55 BoogieIcfgContainer [2022-11-03 02:21:55,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:21:55,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:21:55,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:21:55,425 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:21:55,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:46" (3/4) ... [2022-11-03 02:21:55,429 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:21:55,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:21:55,432 INFO L158 Benchmark]: Toolchain (without parser) took 670039.37ms. Allocated memory was 125.8MB in the beginning and 232.8MB in the end (delta: 107.0MB). Free memory was 85.3MB in the beginning and 141.6MB in the end (delta: -56.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-11-03 02:21:55,432 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:55,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.98ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 98.2MB in the end (delta: -13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:21:55,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.00ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:55,434 INFO L158 Benchmark]: Boogie Preprocessor took 25.70ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:55,434 INFO L158 Benchmark]: RCFGBuilder took 376.88ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 80.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:21:55,434 INFO L158 Benchmark]: TraceAbstraction took 669292.11ms. Allocated memory was 125.8MB in the beginning and 232.8MB in the end (delta: 107.0MB). Free memory was 80.1MB in the beginning and 141.6MB in the end (delta: -61.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:55,435 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 232.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:55,436 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.98ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 98.2MB in the end (delta: -13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.00ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.70ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.88ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 80.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 669292.11ms. Allocated memory was 125.8MB in the beginning and 232.8MB in the end (delta: 107.0MB). Free memory was 80.1MB in the beginning and 141.6MB in the end (delta: -61.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 232.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND TRUE !cond [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 0 [L32] i=0 [L32] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 [2022-11-03 02:21:58,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:21:58,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:21:58,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:21:58,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:21:58,824 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:21:58,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/s2if.c [2022-11-03 02:21:58,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/268ea22dc/554885084dcd4b45876e914fbfa960f9/FLAGcca8a1e61 [2022-11-03 02:21:59,625 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:21:59,626 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c [2022-11-03 02:21:59,634 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/268ea22dc/554885084dcd4b45876e914fbfa960f9/FLAGcca8a1e61 [2022-11-03 02:21:59,966 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/data/268ea22dc/554885084dcd4b45876e914fbfa960f9 [2022-11-03 02:21:59,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:21:59,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:21:59,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:21:59,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:21:59,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:21:59,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:59" (1/1) ... [2022-11-03 02:21:59,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30886021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:59, skipping insertion in model container [2022-11-03 02:21:59,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:59" (1/1) ... [2022-11-03 02:21:59,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:22:00,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:22:00,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-03 02:22:00,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:22:00,280 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:22:00,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-03 02:22:00,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:22:00,384 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:22:00,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00 WrapperNode [2022-11-03 02:22:00,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:22:00,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:22:00,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:22:00,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:22:00,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,474 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-11-03 02:22:00,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:22:00,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:22:00,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:22:00,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:22:00,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:22:00,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:22:00,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:22:00,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:22:00,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (1/1) ... [2022-11-03 02:22:00,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:22:00,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:00,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:22:00,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:22:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:22:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:22:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:22:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-03 02:22:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:22:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:22:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:22:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:22:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-03 02:22:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:22:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:22:00,804 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:22:00,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:22:01,225 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:22:01,231 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:22:01,232 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:22:01,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:22:01 BoogieIcfgContainer [2022-11-03 02:22:01,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:22:01,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:22:01,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:22:01,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:22:01,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:21:59" (1/3) ... [2022-11-03 02:22:01,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efa1bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:22:01, skipping insertion in model container [2022-11-03 02:22:01,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:22:00" (2/3) ... [2022-11-03 02:22:01,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efa1bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:22:01, skipping insertion in model container [2022-11-03 02:22:01,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:22:01" (3/3) ... [2022-11-03 02:22:01,269 INFO L112 eAbstractionObserver]: Analyzing ICFG s2if.c [2022-11-03 02:22:01,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:22:01,308 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:22:01,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:22:01,400 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;@c0d96dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:22:01,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:22:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:22:01,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:01,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:01,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-03 02:22:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:01,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131601644] [2022-11-03 02:22:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:01,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:01,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:01,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:01,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:22:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:01,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:22:01,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:01,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:22:01,639 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:01,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131601644] [2022-11-03 02:22:01,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131601644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:22:01,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:22:01,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:22:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736190059] [2022-11-03 02:22:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:22:01,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:22:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:22:01,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:22:01,699 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:01,725 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-03 02:22:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:22:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:22:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:01,736 INFO L225 Difference]: With dead ends: 34 [2022-11-03 02:22:01,736 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 02:22:01,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:22:01,747 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:01,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:22:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 02:22:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 02:22:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-03 02:22:01,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-03 02:22:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:01,805 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-03 02:22:01,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-03 02:22:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:22:01,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:01,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:01,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 02:22:02,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:22:02,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-03 02:22:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:02,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440293059] [2022-11-03 02:22:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:02,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:02,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:02,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:22:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:02,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:22:02,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:02,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:22:02,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:02,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440293059] [2022-11-03 02:22:02,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440293059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:22:02,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:22:02,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:22:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575340088] [2022-11-03 02:22:02,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:22:02,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:22:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:22:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:22:02,352 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:02,777 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-03 02:22:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:22:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:22:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:02,786 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:22:02,787 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:22:02,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:22:02,789 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:02,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 8 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:22:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:22:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-03 02:22:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-03 02:22:02,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-03 02:22:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:02,798 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-03 02:22:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-03 02:22:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:22:02,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:02,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:02,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-03 02:22:03,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:22:03,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-03 02:22:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451833435] [2022-11-03 02:22:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:03,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:03,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:03,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:03,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:22:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:03,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:22:03,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:03,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:22:03,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:03,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:22:03,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:03,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:22:04,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:04,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-11-03 02:22:04,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:04,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 94 treesize of output 52 [2022-11-03 02:22:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:04,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:11,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:11,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451833435] [2022-11-03 02:22:11,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451833435] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [689596668] [2022-11-03 02:22:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:22:11,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:22:11,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-03 02:22:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:22:12,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:12,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:12,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:12,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:22:12,494 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:22:12,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-03 02:22:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:12,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 02:22:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:13,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:13,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 51 [2022-11-03 02:22:14,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:14,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 52 [2022-11-03 02:22:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:14,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:23,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:23,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:23,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 79 [2022-11-03 02:22:23,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:23,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2022-11-03 02:22:23,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-11-03 02:22:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [689596668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257743434] [2022-11-03 02:22:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:22:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:23,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:22:23,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:22:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:23,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:22:23,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:24,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:22:24,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:24,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:22:24,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 02:22:24,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:24,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 51 [2022-11-03 02:22:27,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:27,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 90 treesize of output 52 [2022-11-03 02:22:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:27,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:34,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:34,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:34,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 85 [2022-11-03 02:22:34,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:34,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:34,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 43 [2022-11-03 02:22:34,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-11-03 02:22:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:34,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257743434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:34,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:22:34,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9, 10, 10, 11] total 37 [2022-11-03 02:22:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119111603] [2022-11-03 02:22:34,446 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:34,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:22:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:22:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1074, Unknown=16, NotChecked=0, Total=1332 [2022-11-03 02:22:34,450 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:36,085 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-03 02:22:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:22:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:22:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:36,089 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:22:36,089 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:22:36,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=369, Invalid=1507, Unknown=16, NotChecked=0, Total=1892 [2022-11-03 02:22:36,091 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:36,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 61 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-11-03 02:22:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:22:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-11-03 02:22:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-03 02:22:36,101 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-03 02:22:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:36,102 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-03 02:22:36,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-03 02:22:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:22:36,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:36,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:36,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:36,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:36,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:36,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:36,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-11-03 02:22:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:36,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450589120] [2022-11-03 02:22:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:36,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:36,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:22:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:36,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:22:36,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:36,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:22:36,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-03 02:22:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:36,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:37,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-03 02:22:37,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-03 02:22:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:37,085 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:37,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450589120] [2022-11-03 02:22:37,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450589120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:37,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736661611] [2022-11-03 02:22:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:37,086 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:22:37,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:22:37,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 02:22:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:37,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:22:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:37,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:22:37,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-03 02:22:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:37,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:37,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-03 02:22:37,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-03 02:22:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736661611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671667330] [2022-11-03 02:22:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:22:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:37,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:22:37,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:22:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:37,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:22:37,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:37,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:22:37,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-03 02:22:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:37,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:37,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-03 02:22:37,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-03 02:22:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671667330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:37,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:22:37,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2022-11-03 02:22:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066290807] [2022-11-03 02:22:37,801 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:37,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:22:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:22:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:22:37,803 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:38,142 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-03 02:22:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:22:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:22:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:38,144 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:22:38,144 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:22:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:22:38,146 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:38,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:22:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:22:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-03 02:22:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-03 02:22:38,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-03 02:22:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:38,158 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-03 02:22:38,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-03 02:22:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:22:38,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:38,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:38,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:38,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:38,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:38,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:38,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:38,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-03 02:22:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:38,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368078850] [2022-11-03 02:22:38,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:22:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:38,764 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:38,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:22:38,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:22:38,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:38,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:22:38,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:39,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:39,829 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:39,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368078850] [2022-11-03 02:22:39,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368078850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:39,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [89964916] [2022-11-03 02:22:39,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:22:39,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:39,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:22:39,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:22:39,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-03 02:22:40,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:22:40,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:40,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:22:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:40,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [89964916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452215828] [2022-11-03 02:22:40,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:22:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:22:40,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:40,351 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:22:40,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:22:40,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:22:40,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:40,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:22:40,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:40,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:40,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452215828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:40,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:22:40,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11, 9, 8, 7] total 25 [2022-11-03 02:22:40,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796095582] [2022-11-03 02:22:40,917 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:40,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:22:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:22:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:22:40,919 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:42,925 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-11-03 02:22:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:22:42,926 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:22:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:42,927 INFO L225 Difference]: With dead ends: 54 [2022-11-03 02:22:42,927 INFO L226 Difference]: Without dead ends: 47 [2022-11-03 02:22:42,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:22:42,929 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 164 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:42,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 19 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:22:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-03 02:22:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-11-03 02:22:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-03 02:22:42,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 18 [2022-11-03 02:22:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:42,939 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-03 02:22:42,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-03 02:22:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:22:42,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:42,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:42,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:43,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:43,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-11-03 02:22:43,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:43,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-03 02:22:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554317419] [2022-11-03 02:22:43,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:22:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:43,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:43,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 02:22:43,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:22:43,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:43,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:22:43,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:43,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:44,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:22:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554317419] [2022-11-03 02:22:44,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554317419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919861680] [2022-11-03 02:22:44,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:22:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:22:44,223 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:22:44,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-03 02:22:44,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:22:44,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:44,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:22:44,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:44,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1919861680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113163624] [2022-11-03 02:22:44,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:22:44,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:22:44,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:44,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:22:44,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:22:44,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:22:44,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:44,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:22:44,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:44,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113163624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:44,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:22:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9, 7, 8, 7] total 17 [2022-11-03 02:22:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072018767] [2022-11-03 02:22:44,967 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:22:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:22:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:22:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:22:44,969 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:46,046 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-03 02:22:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:22:46,047 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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 19 [2022-11-03 02:22:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:46,048 INFO L225 Difference]: With dead ends: 46 [2022-11-03 02:22:46,048 INFO L226 Difference]: Without dead ends: 34 [2022-11-03 02:22:46,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:22:46,050 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:46,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 13 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:22:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-03 02:22:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-03 02:22:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-03 02:22:46,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2022-11-03 02:22:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:46,063 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-03 02:22:46,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:22:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-03 02:22:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:22:46,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:46,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:22:46,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:46,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:46,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:46,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:22:46,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:22:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-03 02:22:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:22:46,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211250153] [2022-11-03 02:22:46,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:22:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:22:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:22:46,668 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:22:46,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 02:22:46,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:22:46,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:46,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:22:46,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:46,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:22:46,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:22:46,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:22:47,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 02:22:47,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:47,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:22:47,789 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:22:47,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 63 [2022-11-03 02:22:48,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:48,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 73 [2022-11-03 02:22:48,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:48,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 83 [2022-11-03 02:22:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:48,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:00,836 INFO L356 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-11-03 02:23:00,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 869 treesize of output 557 [2022-11-03 02:24:00,404 WARN L234 SmtUtils]: Spent 36.60s on a formula simplification. DAG size of input: 83 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:24:00,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:00,480 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 02:24:00,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 546 treesize of output 1 [2022-11-03 02:24:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:00,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:24:00,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211250153] [2022-11-03 02:24:00,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211250153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:24:00,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [705849549] [2022-11-03 02:24:00,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:24:00,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:24:00,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:24:00,489 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:24:00,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-03 02:24:00,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:24:00,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:24:00,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:24:00,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:24:01,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:24:01,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:01,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:24:03,054 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:24:03,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-03 02:24:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:03,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 02:24:05,626 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:24:05,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-03 02:24:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:05,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 02:24:20,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:21,423 INFO L356 Elim1Store]: treesize reduction 121, result has 17.1 percent of original size [2022-11-03 02:24:21,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 62 [2022-11-03 02:24:25,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:25,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:25,885 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:24:25,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 75 [2022-11-03 02:24:28,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:24:28,508 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:24:28,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 131 treesize of output 75 [2022-11-03 02:24:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:28,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:25:09,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:25:09,456 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-03 02:25:09,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 698 treesize of output 1 [2022-11-03 02:25:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:25:09,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [705849549] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:25:09,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129974883] [2022-11-03 02:25:09,458 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:25:09,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:25:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:25:09,460 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:25:09,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d38f3308-4b3d-484d-b169-5986d1ccfee4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:25:09,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:25:09,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:25:09,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:25:09,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:25:09,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:25:09,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:25:09,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-03 02:25:10,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 02:25:10,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 02:25:24,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:25:24,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 51 [2022-11-03 02:25:28,361 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:25:28,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 79