./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_flag-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- 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-02 21:08:17,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:08:17,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:08:17,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:08:17,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:08:17,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:08:17,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:08:17,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:08:17,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:08:17,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:08:17,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:08:17,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:08:17,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:08:17,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:08:17,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:08:17,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:08:17,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:08:17,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:08:17,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:08:17,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:08:17,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:08:17,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:08:17,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:08:17,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:08:17,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:08:17,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:08:17,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:08:17,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:08:17,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:08:17,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:08:17,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:08:17,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:08:17,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:08:17,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:08:17,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:08:17,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:08:17,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:08:17,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:08:17,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:08:17,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:08:17,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:08:17,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:08:17,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:08:17,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:08:17,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:08:17,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:08:17,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:08:17,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:08:17,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:08:17,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:08:17,825 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:08:17,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:08:17,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:08:17,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:08:17,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:08:17,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:08:17,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:08:17,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:08:17,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:08:17,829 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:08:17,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:08:17,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:08:17,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:08:17,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:08:17,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:08:17,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:08:17,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:17,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:08:17,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:08:17,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:08:17,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:08:17,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:08:17,832 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:08:17,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:08:17,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:08:17,833 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_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/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_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-11-02 21:08:18,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:08:18,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:08:18,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:08:18,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:08:18,229 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:08:18,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-properties/list_flag-2.i [2022-11-02 21:08:18,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/data/babef7408/1ce2e4408bf54544b34e64ab6997c449/FLAG9afbf071f [2022-11-02 21:08:19,028 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:08:19,029 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/sv-benchmarks/c/list-properties/list_flag-2.i [2022-11-02 21:08:19,042 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/data/babef7408/1ce2e4408bf54544b34e64ab6997c449/FLAG9afbf071f [2022-11-02 21:08:19,304 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/data/babef7408/1ce2e4408bf54544b34e64ab6997c449 [2022-11-02 21:08:19,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:08:19,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:08:19,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:19,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:08:19,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:08:19,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2262c01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19, skipping insertion in model container [2022-11-02 21:08:19,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:08:19,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:08:19,771 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_d0be0fa2-481b-4e74-9378-68d1d00704b6/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-11-02 21:08:19,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:19,794 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:08:19,853 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_d0be0fa2-481b-4e74-9378-68d1d00704b6/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-11-02 21:08:19,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:19,892 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:08:19,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19 WrapperNode [2022-11-02 21:08:19,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:19,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:19,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:08:19,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:08:19,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,946 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-11-02 21:08:19,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:19,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:08:19,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:08:19,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:08:19,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:19,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:08:19,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:08:19,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:08:19,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:08:19,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (1/1) ... [2022-11-02 21:08:20,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:20,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:08:20,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:08:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 21:08:20,164 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 21:08:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:08:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:08:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:08:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:08:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:08:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:08:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:08:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:08:20,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:08:20,333 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:08:20,336 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:08:20,395 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 21:08:20,555 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:08:20,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:08:20,574 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:08:20,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:20 BoogieIcfgContainer [2022-11-02 21:08:20,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:08:20,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:08:20,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:08:20,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:08:20,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:08:19" (1/3) ... [2022-11-02 21:08:20,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cea62ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:20, skipping insertion in model container [2022-11-02 21:08:20,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:19" (2/3) ... [2022-11-02 21:08:20,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cea62ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:20, skipping insertion in model container [2022-11-02 21:08:20,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:20" (3/3) ... [2022-11-02 21:08:20,590 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-11-02 21:08:20,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:08:20,615 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:08:20,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:20,715 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=PETRI_NET, 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;@3dc040c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:20,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:08:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:08:20,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:20,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:20,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2022-11-02 21:08:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:20,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396362141] [2022-11-02 21:08:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:20,969 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-02 21:08:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396362141] [2022-11-02 21:08:20,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396362141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:20,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730693205] [2022-11-02 21:08:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:21,013 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 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-02 21:08:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:21,033 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-11-02 21:08:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:21,035 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-02 21:08:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:21,043 INFO L225 Difference]: With dead ends: 40 [2022-11-02 21:08:21,043 INFO L226 Difference]: Without dead ends: 20 [2022-11-02 21:08:21,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02 21:08:21,049 INFO L413 NwaCegarLoop]: 33 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, 33 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-02 21:08:21,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:08:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-02 21:08:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-02 21:08:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-02 21:08:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-02 21:08:21,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-11-02 21:08:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:21,086 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-02 21:08:21,087 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-02 21:08:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-02 21:08:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:08:21,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:21,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:21,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:08:21,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2022-11-02 21:08:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:21,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799791017] [2022-11-02 21:08:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:21,400 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-02 21:08:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:21,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799791017] [2022-11-02 21:08:21,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799791017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:21,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:08:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683746623] [2022-11-02 21:08:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:08:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:08:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:08:21,405 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-02 21:08:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:21,562 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-11-02 21:08:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:08:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 13 [2022-11-02 21:08:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:21,566 INFO L225 Difference]: With dead ends: 44 [2022-11-02 21:08:21,566 INFO L226 Difference]: Without dead ends: 40 [2022-11-02 21:08:21,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:21,574 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:21,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-02 21:08:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-02 21:08:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-02 21:08:21,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2022-11-02 21:08:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:21,601 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-02 21:08:21,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-02 21:08:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-02 21:08:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:08:21,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:21,606 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:21,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:08:21,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:21,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2022-11-02 21:08:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:21,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976666293] [2022-11-02 21:08:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:21,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976666293] [2022-11-02 21:08:21,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976666293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:21,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:21,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:08:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095948051] [2022-11-02 21:08:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:21,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:08:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:21,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:08:21,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:08:21,900 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-02 21:08:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:22,023 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-11-02 21:08:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:08:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2022-11-02 21:08:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:22,024 INFO L225 Difference]: With dead ends: 46 [2022-11-02 21:08:22,024 INFO L226 Difference]: Without dead ends: 38 [2022-11-02 21:08:22,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:22,026 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:22,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-02 21:08:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-11-02 21:08:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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-02 21:08:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-02 21:08:22,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-11-02 21:08:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:22,032 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-02 21:08:22,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-02 21:08:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-02 21:08:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:08:22,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:22,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:22,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:08:22,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:22,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2022-11-02 21:08:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595779411] [2022-11-02 21:08:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:22,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595779411] [2022-11-02 21:08:22,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595779411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:22,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:22,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:08:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174379599] [2022-11-02 21:08:22,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:22,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:08:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:08:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:08:22,164 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-02 21:08:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:22,250 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-02 21:08:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:08:22,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2022-11-02 21:08:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:22,253 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:08:22,253 INFO L226 Difference]: Without dead ends: 40 [2022-11-02 21:08:22,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:22,254 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:22,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-02 21:08:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2022-11-02 21:08:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-02 21:08:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-02 21:08:22,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-11-02 21:08:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:22,262 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-02 21:08:22,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-02 21:08:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-02 21:08:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:08:22,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:22,263 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:22,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:08:22,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2022-11-02 21:08:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:22,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629961691] [2022-11-02 21:08:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:22,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629961691] [2022-11-02 21:08:22,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629961691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:22,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138321948] [2022-11-02 21:08:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:22,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:22,331 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02 21:08:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:22,352 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-02 21:08:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:08:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:22,353 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:08:22,353 INFO L226 Difference]: Without dead ends: 34 [2022-11-02 21:08:22,354 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-02 21:08:22,355 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:22,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:08:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-02 21:08:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-11-02 21:08:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-11-02 21:08:22,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-11-02 21:08:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:22,360 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-11-02 21:08:22,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02 21:08:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-11-02 21:08:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:08:22,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:22,367 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:08:22,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2022-11-02 21:08:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151110614] [2022-11-02 21:08:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:22,897 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-02 21:08:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151110614] [2022-11-02 21:08:22,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151110614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:22,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844444372] [2022-11-02 21:08:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:22,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:22,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:22,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:08:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:23,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:08:23,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:23,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:23,210 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-02 21:08:23,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:23,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:23,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:23,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:08:23,485 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 14 treesize of output 16 [2022-11-02 21:08:23,527 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-02 21:08:23,536 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-02 21:08:23,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:23,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:08:23,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (v_ArrVal_106 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_104)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:08:23,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:23,705 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 23 treesize of output 29 [2022-11-02 21:08:23,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:23,720 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 30 treesize of output 33 [2022-11-02 21:08:23,734 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 9 treesize of output 7 [2022-11-02 21:08:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:08:23,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844444372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:23,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:23,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-02 21:08:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380213767] [2022-11-02 21:08:23,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:23,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:08:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:08:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2022-11-02 21:08:23,938 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:24,195 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-02 21:08:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:08:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:08:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:24,197 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:08:24,197 INFO L226 Difference]: Without dead ends: 46 [2022-11-02 21:08:24,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=329, Unknown=2, NotChecked=78, Total=506 [2022-11-02 21:08:24,199 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:24,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-11-02 21:08:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-02 21:08:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-11-02 21:08:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-02 21:08:24,204 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2022-11-02 21:08:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:24,205 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-02 21:08:24,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-02 21:08:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:08:24,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:24,206 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:24,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:24,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 21:08:24,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:24,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2022-11-02 21:08:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:24,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157908061] [2022-11-02 21:08:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:24,807 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-02 21:08:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:24,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157908061] [2022-11-02 21:08:24,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157908061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:24,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123773317] [2022-11-02 21:08:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:24,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:24,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:24,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:24,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:08:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:24,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:08:24,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:24,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:25,007 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-02 21:08:25,069 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:25,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:25,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:25,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:08:25,197 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 14 treesize of output 16 [2022-11-02 21:08:25,226 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-02 21:08:25,229 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-02 21:08:25,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:25,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-02 21:08:25,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_155 Int) (v_ArrVal_158 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_155)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:08:25,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:25,329 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 23 treesize of output 29 [2022-11-02 21:08:25,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:25,343 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 30 treesize of output 33 [2022-11-02 21:08:25,353 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 9 treesize of output 7 [2022-11-02 21:08:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:08:25,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123773317] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:25,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:25,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-02 21:08:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113229797] [2022-11-02 21:08:25,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:25,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:08:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:08:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=240, Unknown=3, NotChecked=66, Total=380 [2022-11-02 21:08:25,510 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:29,841 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-11-02 21:08:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:08:29,845 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:08:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:29,846 INFO L225 Difference]: With dead ends: 85 [2022-11-02 21:08:29,846 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 21:08:29,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=108, Invalid=317, Unknown=3, NotChecked=78, Total=506 [2022-11-02 21:08:29,847 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:29,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2022-11-02 21:08:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 21:08:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2022-11-02 21:08:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-11-02 21:08:29,858 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2022-11-02 21:08:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:29,858 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-11-02 21:08:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-11-02 21:08:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:08:29,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:29,860 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:29,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:30,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 21:08:30,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2022-11-02 21:08:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:30,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869190166] [2022-11-02 21:08:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:30,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:30,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869190166] [2022-11-02 21:08:30,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869190166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:30,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:30,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353249961] [2022-11-02 21:08:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:30,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:30,135 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02 21:08:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:30,150 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-11-02 21:08:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:30,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:08:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:30,152 INFO L225 Difference]: With dead ends: 67 [2022-11-02 21:08:30,152 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 21:08:30,152 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-02 21:08:30,153 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:30,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:08:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 21:08:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-11-02 21:08:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 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-02 21:08:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-11-02 21:08:30,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2022-11-02 21:08:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:30,168 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-11-02 21:08:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02 21:08:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-11-02 21:08:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 21:08:30,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:30,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:30,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:08:30,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2022-11-02 21:08:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:30,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211243657] [2022-11-02 21:08:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:30,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:30,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211243657] [2022-11-02 21:08:30,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211243657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:30,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222409202] [2022-11-02 21:08:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:30,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:30,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:08:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:30,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 21:08:30,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:30,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:30,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:30,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:30,807 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 13 treesize of output 9 [2022-11-02 21:08:30,815 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 13 treesize of output 9 [2022-11-02 21:08:30,879 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:30,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 21:08:30,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-02 21:08:30,891 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 29 treesize of output 19 [2022-11-02 21:08:30,933 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 39 treesize of output 21 [2022-11-02 21:08:30,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 21:08:30,950 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-02 21:08:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:30,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:30,993 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 79 treesize of output 57 [2022-11-02 21:08:31,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_231 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 21:08:31,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:31,032 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 21:08:31,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:31,042 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 36 treesize of output 35 [2022-11-02 21:08:31,060 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 3 [2022-11-02 21:08:31,073 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:08:31,073 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 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-02 21:08:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:08:31,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222409202] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:31,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:31,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 21:08:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496040893] [2022-11-02 21:08:31,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:31,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:08:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:31,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:08:31,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-11-02 21:08:31,203 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-02 21:08:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:31,507 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-11-02 21:08:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:08:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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 21 [2022-11-02 21:08:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:31,510 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:08:31,510 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 21:08:31,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2022-11-02 21:08:31,512 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:31,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 204 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-11-02 21:08:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 21:08:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-02 21:08:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 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-02 21:08:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-02 21:08:31,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2022-11-02 21:08:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:31,521 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-02 21:08:31,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-02 21:08:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-02 21:08:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 21:08:31,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:31,522 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:31,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:31,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:31,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2022-11-02 21:08:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:31,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439423068] [2022-11-02 21:08:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:32,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439423068] [2022-11-02 21:08:32,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439423068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:32,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997085120] [2022-11-02 21:08:32,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:08:32,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:32,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:32,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:32,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:08:32,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:08:32,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:32,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:08:32,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:32,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:32,379 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:32,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:32,413 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 13 treesize of output 9 [2022-11-02 21:08:32,420 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 13 treesize of output 9 [2022-11-02 21:08:32,467 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:32,468 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 21:08:32,477 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 42 treesize of output 44 [2022-11-02 21:08:32,483 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 29 treesize of output 19 [2022-11-02 21:08:32,520 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 39 treesize of output 21 [2022-11-02 21:08:32,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 21:08:32,543 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-02 21:08:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:32,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:32,623 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 52 treesize of output 30 [2022-11-02 21:08:32,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 21:08:32,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:32,656 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 21:08:32,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:32,664 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 38 treesize of output 31 [2022-11-02 21:08:32,669 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 11 treesize of output 7 [2022-11-02 21:08:32,690 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:08:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-02 21:08:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:08:32,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997085120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:32,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-02 21:08:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246966914] [2022-11-02 21:08:32,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:32,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:08:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:08:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-11-02 21:08:32,844 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:33,393 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-11-02 21:08:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:08:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 21:08:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:33,396 INFO L225 Difference]: With dead ends: 67 [2022-11-02 21:08:33,396 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 21:08:33,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-11-02 21:08:33,397 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-11-02 21:08:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 21:08:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-02 21:08:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 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-02 21:08:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-02 21:08:33,403 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2022-11-02 21:08:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:33,403 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-02 21:08:33,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-02 21:08:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 21:08:33,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:33,404 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:33,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:33,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:33,624 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2022-11-02 21:08:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:33,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123216306] [2022-11-02 21:08:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:34,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123216306] [2022-11-02 21:08:34,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123216306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:34,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511244550] [2022-11-02 21:08:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:34,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:34,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:34,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:08:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:08:34,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:34,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:34,228 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:34,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:34,264 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 13 treesize of output 9 [2022-11-02 21:08:34,272 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 13 treesize of output 9 [2022-11-02 21:08:34,321 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:34,322 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 21:08:34,329 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 29 treesize of output 19 [2022-11-02 21:08:34,332 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 32 treesize of output 34 [2022-11-02 21:08:34,370 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 39 treesize of output 21 [2022-11-02 21:08:34,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 21:08:34,393 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-02 21:08:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:34,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:34,487 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 52 treesize of output 30 [2022-11-02 21:08:34,493 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_338 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-02 21:08:34,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:34,530 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 21:08:34,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:34,538 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 38 treesize of output 31 [2022-11-02 21:08:34,542 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 11 treesize of output 7 [2022-11-02 21:08:34,563 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:08:34,563 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 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-02 21:08:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:08:34,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511244550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:34,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:34,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-02 21:08:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970082097] [2022-11-02 21:08:34,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:34,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:08:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:08:34,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-11-02 21:08:34,690 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:35,151 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-02 21:08:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:08:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 21:08:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:35,155 INFO L225 Difference]: With dead ends: 61 [2022-11-02 21:08:35,156 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 21:08:35,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-11-02 21:08:35,159 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:35,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 191 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-11-02 21:08:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 21:08:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-11-02 21:08:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-02 21:08:35,179 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2022-11-02 21:08:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:35,180 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-02 21:08:35,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-02 21:08:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:08:35,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:35,186 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:35,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:35,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 21:08:35,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1075490678, now seen corresponding path program 2 times [2022-11-02 21:08:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:35,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562275843] [2022-11-02 21:08:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:35,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:35,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562275843] [2022-11-02 21:08:35,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562275843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976130706] [2022-11-02 21:08:35,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:08:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:35,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:35,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:08:35,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:08:35,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:35,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:08:35,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:35,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:35,942 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-02 21:08:35,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:35,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:36,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:36,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:08:36,069 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 14 treesize of output 16 [2022-11-02 21:08:36,116 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 14 treesize of output 16 [2022-11-02 21:08:36,181 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:08:36,181 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 19 treesize of output 22 [2022-11-02 21:08:36,329 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-02 21:08:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:36,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:37,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-02 21:08:37,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-11-02 21:08:37,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-11-02 21:08:37,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_415 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_415)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-02 21:08:38,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:38,054 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 95 treesize of output 61 [2022-11-02 21:08:38,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:38,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-11-02 21:08:38,094 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 257 treesize of output 241 [2022-11-02 21:08:38,147 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 6 treesize of output 4 [2022-11-02 21:08:38,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:38,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-02 21:08:38,837 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 133 treesize of output 125 [2022-11-02 21:08:39,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:39,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 294 [2022-11-02 21:08:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 21:08:39,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976130706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:39,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:39,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-11-02 21:08:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340477877] [2022-11-02 21:08:39,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:39,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:08:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:08:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-11-02 21:08:39,719 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:08:39,839 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 21:08:39,849 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 21:08:39,857 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-02 21:08:41,215 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-11-02 21:08:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:41,316 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-11-02 21:08:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:08:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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 25 [2022-11-02 21:08:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:41,317 INFO L225 Difference]: With dead ends: 55 [2022-11-02 21:08:41,317 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 21:08:41,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-11-02 21:08:41,318 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:41,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2022-11-02 21:08:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 21:08:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-02 21:08:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-02 21:08:41,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2022-11-02 21:08:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:41,324 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-02 21:08:41,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:08:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-02 21:08:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:08:41,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:41,334 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:41,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:08:41,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1387463807, now seen corresponding path program 2 times [2022-11-02 21:08:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312440539] [2022-11-02 21:08:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:41,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312440539] [2022-11-02 21:08:41,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312440539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:41,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076974925] [2022-11-02 21:08:41,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:08:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:41,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:41,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:42,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:08:42,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:08:42,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:42,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:08:42,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:42,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:42,174 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-02 21:08:42,218 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:42,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:42,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:42,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:08:42,297 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 14 treesize of output 16 [2022-11-02 21:08:42,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 14 treesize of output 16 [2022-11-02 21:08:42,395 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:08:42,395 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 19 treesize of output 22 [2022-11-02 21:08:42,528 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-02 21:08:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:42,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:44,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-11-02 21:08:44,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-11-02 21:08:44,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-02 21:08:44,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_500)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-02 21:08:44,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:44,794 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 95 treesize of output 61 [2022-11-02 21:08:44,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:44,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-11-02 21:08:44,828 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 257 treesize of output 241 [2022-11-02 21:08:44,863 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 6 treesize of output 4 [2022-11-02 21:08:44,898 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 133 treesize of output 125 [2022-11-02 21:08:45,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:45,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 137 [2022-11-02 21:08:45,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:45,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 329 [2022-11-02 21:08:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 21:08:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076974925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:46,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:46,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-11-02 21:08:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729194497] [2022-11-02 21:08:46,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:46,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:08:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:08:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-11-02 21:08:46,493 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:08:46,635 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:08:46,640 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:08:46,650 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:08:48,654 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:08:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:48,782 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-11-02 21:08:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:08:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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 25 [2022-11-02 21:08:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:48,784 INFO L225 Difference]: With dead ends: 75 [2022-11-02 21:08:48,784 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 21:08:48,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-11-02 21:08:48,785 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:48,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 211 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-11-02 21:08:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 21:08:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-11-02 21:08:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 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-02 21:08:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-02 21:08:48,792 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2022-11-02 21:08:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-02 21:08:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:08:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-02 21:08:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:08:48,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:48,794 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:48,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:49,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:49,009 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2022-11-02 21:08:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:49,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784860031] [2022-11-02 21:08:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,946 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-02 21:08:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784860031] [2022-11-02 21:08:49,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784860031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957945784] [2022-11-02 21:08:49,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:08:49,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:49,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:49,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:49,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:08:50,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 21:08:50,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:50,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 21:08:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:50,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:50,128 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:50,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:50,183 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-02 21:08:50,190 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-02 21:08:50,278 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:50,278 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 22 treesize of output 22 [2022-11-02 21:08:50,285 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-02 21:08:50,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:50,292 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 21 treesize of output 21 [2022-11-02 21:08:50,416 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:50,416 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-02 21:08:50,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:50,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-02 21:08:50,430 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-02 21:08:50,529 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:08:50,529 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 72 treesize of output 72 [2022-11-02 21:08:50,561 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-02 21:08:50,561 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 2 case distinctions, treesize of input 65 treesize of output 70 [2022-11-02 21:08:50,581 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 21:08:50,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-11-02 21:08:50,590 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 23 treesize of output 11 [2022-11-02 21:08:50,608 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 69 treesize of output 57 [2022-11-02 21:08:50,698 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 41 treesize of output 33 [2022-11-02 21:08:50,730 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 53 treesize of output 45 [2022-11-02 21:08:51,669 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 117 treesize of output 93 [2022-11-02 21:08:51,692 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-02 21:08:51,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 78 [2022-11-02 21:08:51,995 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:51,995 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 22 treesize of output 14 [2022-11-02 21:08:52,024 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-02 21:08:52,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:54,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 1) (= .cse0 3)))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-11-02 21:08:54,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse0 1)))))) is different from false [2022-11-02 21:08:54,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 1) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-11-02 21:08:54,414 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-02 21:08:54,415 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 3943 treesize of output 3711 [2022-11-02 21:08:54,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:54,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2122 treesize of output 1860 [2022-11-02 21:08:58,454 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 8 treesize of output 4 [2022-11-02 21:08:58,475 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 8 treesize of output 4 [2022-11-02 21:08:58,572 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 8 treesize of output 4 [2022-11-02 21:08:58,705 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 8 treesize of output 4 [2022-11-02 21:08:58,893 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 8 treesize of output 4 [2022-11-02 21:08:59,053 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 8 treesize of output 4 [2022-11-02 21:08:59,260 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse5))))) .cse6)) (not .cse7)) (or (and .cse0 .cse7) (let ((.cse8 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse52 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 0))))))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse50)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse48 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse19 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse47 0))))))) (.cse20 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse46))))) (.cse21 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse45)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse22 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse43 0))))))))) (.cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse42)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse41)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse40))))) (.cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse37 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse38 0)))))))))) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or .cse6 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse7) (and .cse8 .cse9 (or .cse6 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse23)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))))))) .cse15 .cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse24)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse25 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse26 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse27)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) .cse17 .cse18 .cse19 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse29 0)))))))) .cse20 .cse21 .cse22)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse30)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse10 .cse11 .cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse31 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse32)))))))) .cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse33)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse34 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse35)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 0)))))))) .cse14 .cse37)) .cse37))))) is different from false [2022-11-02 21:09:02,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:02,914 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 21:09:02,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:02,923 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 21:09:02,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:02,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:02,931 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 18 treesize of output 12 [2022-11-02 21:09:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:02,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:02,937 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 18 treesize of output 12 [2022-11-02 21:09:02,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:02,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 21:09:02,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:02,951 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:02,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:02,959 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 25 treesize of output 19 [2022-11-02 21:09:02,965 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 3 [2022-11-02 21:09:02,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:02,995 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:03,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,004 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 21:09:03,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:03,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,021 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-02 21:09:03,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:03,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,049 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 21:09:03,057 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 3 [2022-11-02 21:09:03,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2022-11-02 21:09:03,082 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,082 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 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-02 21:09:03,091 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:03,111 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,111 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:03,118 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,119 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 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-02 21:09:03,129 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,129 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:03,139 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,139 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 1 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:09:03,149 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,150 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 1 case distinctions, treesize of input 54 treesize of output 1 [2022-11-02 21:09:03,156 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,162 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,167 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,175 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,176 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 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-02 21:09:03,191 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,192 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:03,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:03,202 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 21:09:03,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:03,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-11-02 21:09:03,217 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 15 treesize of output 7 [2022-11-02 21:09:03,221 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 8 treesize of output 4 [2022-11-02 21:09:03,225 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 10 treesize of output 4 [2022-11-02 21:09:03,229 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 3 [2022-11-02 21:09:03,235 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,246 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,246 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:03,257 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,257 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:03,264 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,270 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,279 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,279 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 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-02 21:09:03,286 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:03,296 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:03,297 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 21:09:03,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957945784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:03,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:03,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-11-02 21:09:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225857212] [2022-11-02 21:09:03,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:03,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 21:09:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:03,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 21:09:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=891, Unknown=4, NotChecked=252, Total=1260 [2022-11-02 21:09:03,532 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:09:03,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse7 (not .cse8)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse56 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse5))))) .cse6)) .cse7) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (or (and .cse0 .cse8) (let ((.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse53 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse52 0))))))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse51)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse19 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse49 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse48 0))))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse47))))) (.cse22 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse46)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse23 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))))) (.cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse44 0))))))))) (.cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse43)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse42)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse41))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse38 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse39 0)))))))))) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or .cse6 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse8) (and .cse9 .cse10 (or .cse6 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse24)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))))))) .cse16 .cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse25)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse27 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) .cse18 .cse19 .cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 0)))))))) .cse21 .cse22 .cse23)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse31)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11 .cse12 .cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse32 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse33)))))))) .cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse34)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse36)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))))))) .cse15 .cse38)) .cse38))) (not (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse56 0) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7 .cse6 (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-11-02 21:09:03,928 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse7 (not .cse8)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse56 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or (not .cse0) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse1)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse5))))) .cse6)) .cse7) (or (and .cse0 .cse8) (let ((.cse9 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse10 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse53 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse16 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse52 0))))))))) (.cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse51)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse18 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse19 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse49 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse48 0))))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse47))))) (.cse22 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse46)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 .cse3) 0))))) (.cse23 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))))) (.cse11 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse44 0))))))))) (.cse12 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse43)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (.cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse42)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse41))))) (.cse15 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse38 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse39 0)))))))))) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or .cse6 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse8) (and .cse9 .cse10 (or .cse6 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse24)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))))))) .cse16 .cse17 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse25)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse27 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) .cse18 .cse19 .cse20 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 0)))))))) .cse21 .cse22 .cse23)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse31)))) (forall ((v_ArrVal_598 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11 .cse12 .cse13 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse32 .cse3))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse33)))))))) .cse14 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse34)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 0)))))) (not (= (select v_arrayElimArr_11 .cse3) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse3) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse36)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))))))) .cse15 .cse38)) .cse38))) (not (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse56 0) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7 .cse6 (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-11-02 21:09:03,954 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse6 v_ArrVal_592)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse3 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= .cse3 3) (= .cse3 1) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) is different from false [2022-11-02 21:09:03,965 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse6 v_ArrVal_592)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= 3 .cse3) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse3 1)))))))) is different from false [2022-11-02 21:09:05,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_int| .cse1) .cse7) 1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) (+ .cse7 4)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse0) .cse2))) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (or (= .cse4 1) (= .cse4 3)))) (not (= (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= .cse7 0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3)))) is different from false [2022-11-02 21:09:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:06,247 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-11-02 21:09:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:09:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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 27 [2022-11-02 21:09:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:06,248 INFO L225 Difference]: With dead ends: 67 [2022-11-02 21:09:06,248 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 21:09:06,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=193, Invalid=1394, Unknown=9, NotChecked=756, Total=2352 [2022-11-02 21:09:06,249 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:06,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2022-11-02 21:09:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 21:09:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-02 21:09:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 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-02 21:09:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-11-02 21:09:06,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 27 [2022-11-02 21:09:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:06,269 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-11-02 21:09:06,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:09:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-11-02 21:09:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:09:06,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:06,270 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:06,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:06,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:06,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2022-11-02 21:09:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:06,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933869715] [2022-11-02 21:09:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:07,225 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-02 21:09:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:07,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933869715] [2022-11-02 21:09:07,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933869715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:07,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111772100] [2022-11-02 21:09:07,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:09:07,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:07,233 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:07,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:09:07,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:09:07,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:09:07,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 21:09:07,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:07,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:09:07,432 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:09:07,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:09:07,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, 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-02 21:09:07,490 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-02 21:09:07,575 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:09:07,576 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 21 treesize of output 25 [2022-11-02 21:09:07,595 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 11 treesize of output 7 [2022-11-02 21:09:07,609 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:09:07,610 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 22 treesize of output 22 [2022-11-02 21:09:07,618 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-02 21:09:07,757 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:09:07,758 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-02 21:09:07,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:07,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-02 21:09:07,774 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-02 21:09:07,882 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:09:07,883 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 56 treesize of output 56 [2022-11-02 21:09:07,903 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 21:09:07,903 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-02 21:09:07,933 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-02 21:09:07,933 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 2 case distinctions, treesize of input 36 treesize of output 47 [2022-11-02 21:09:07,946 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 15 treesize of output 11 [2022-11-02 21:09:07,965 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 59 treesize of output 47 [2022-11-02 21:09:08,379 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 101 treesize of output 77 [2022-11-02 21:09:08,405 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-02 21:09:08,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 73 [2022-11-02 21:09:08,650 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:09:08,650 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 22 treesize of output 14 [2022-11-02 21:09:08,675 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-02 21:09:08,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:10,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 2 .cse1) (= 3 .cse1))))))) is different from false [2022-11-02 21:09:10,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse1 3) (= .cse1 2)))))) is different from false [2022-11-02 21:09:11,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse1) (= 2 .cse1)))))) is different from false [2022-11-02 21:09:11,050 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-02 21:09:11,051 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 1842 treesize of output 1780 [2022-11-02 21:09:11,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:11,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 726 [2022-11-02 21:09:12,238 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 8 treesize of output 4 [2022-11-02 21:09:15,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) (.cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse61))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse60 0))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse59 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse58)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (.cse23 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse1 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse3 .cse2) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 .cse2) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (or .cse5 (and .cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse7)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse8 .cse2)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse8 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) .cse10 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse11 .cse2)) (= .cse11 0)))))) .cse12 .cse13 .cse14)) (or (let ((.cse18 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse44)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (.cse19 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse43))))))) (.cse20 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse41 0))))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse40 0)))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse15 .cse2) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse16)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= .cse17 .cse2)) (= .cse17 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) (or .cse5 (and .cse18 .cse19 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse24)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse25 .cse2)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse25 0)))))) .cse20 .cse21 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= .cse27 .cse2)) (= .cse27 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) .cse22)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse28 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse30) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 .cse2) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse32) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 .cse2) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse33 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse34 .cse2) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse34 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse36) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse37 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse39 0)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse45 .cse2) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse45 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse46 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse47) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and .cse6 .cse10 .cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= .cse49 .cse2)) (= .cse49 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse13 .cse14) .cse23) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse50 .cse2) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse51)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse52) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse53 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse53 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse56) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) is different from false [2022-11-02 21:09:18,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:18,916 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 1 case distinctions, treesize of input 54 treesize of output 44 [2022-11-02 21:09:18,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:18,925 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 21:09:18,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:18,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:18,944 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:09:18,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 21 [2022-11-02 21:09:18,969 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 8 treesize of output 4 [2022-11-02 21:09:18,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:18,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:18,982 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 21:09:18,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 21:09:18,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:18,996 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 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-02 21:09:18,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:18,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:19,012 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:09:19,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-02 21:09:19,017 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 8 treesize of output 4 [2022-11-02 21:09:19,031 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,032 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,043 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:09:19,054 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,054 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:19,075 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,076 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,086 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:19,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,097 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:19,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:19,105 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 25 treesize of output 19 [2022-11-02 21:09:19,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-02 21:09:19,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:19,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,139 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-02 21:09:19,145 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 23 treesize of output 15 [2022-11-02 21:09:19,183 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,184 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,197 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,197 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 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-02 21:09:19,209 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,210 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,238 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 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-02 21:09:19,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,249 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 21:09:19,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:19,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:19,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:09:19,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-11-02 21:09:19,273 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 8 treesize of output 4 [2022-11-02 21:09:19,280 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 10 treesize of output 4 [2022-11-02 21:09:19,285 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 3 [2022-11-02 21:09:19,289 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 15 treesize of output 7 [2022-11-02 21:09:19,299 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,300 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:19,311 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-02 21:09:19,326 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,326 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 1 case distinctions, treesize of input 103 treesize of output 1 [2022-11-02 21:09:19,343 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-11-02 21:09:19,355 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:09:19,364 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,364 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 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-02 21:09:19,375 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,376 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,392 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,392 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 1 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:09:19,403 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,403 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:19,418 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,418 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 1 case distinctions, treesize of input 54 treesize of output 1 [2022-11-02 21:09:19,429 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,430 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 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-02 21:09:19,443 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,443 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:09:19,456 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:09:19,456 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 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-02 21:09:19,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,464 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 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-02 21:09:19,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:19,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:19,481 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-02 21:09:19,488 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 34 treesize of output 22 [2022-11-02 21:09:19,526 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:09:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 21:09:19,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111772100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:19,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:19,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-11-02 21:09:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117163510] [2022-11-02 21:09:19,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:19,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 21:09:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 21:09:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=890, Unknown=4, NotChecked=252, Total=1260 [2022-11-02 21:09:19,804 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:09:22,112 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) (.cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse64))))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse63 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse63 0))))))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse62 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse61)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (.cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (.cse25 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse47 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse1 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse3 .cse2) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 .cse2) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (not (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse6 (and .cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse8)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse9 .cse2)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse9 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) .cse11 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse12 .cse2)) (= .cse12 0)))))) .cse13 .cse14 .cse15)) (= .cse16 0) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.base|) (or (let ((.cse20 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse46)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse45))))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (.cse23 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse43 0))))))) (.cse24 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse42 0)))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse17 .cse2) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse18)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= .cse19 .cse2)) (= .cse19 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse6 (and .cse20 .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse2)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse26)))))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= .cse27 .cse2)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= .cse27 0)))))) .cse22 .cse23 (forall ((v_arrayElimArr_31 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= .cse29 .cse2)) (= .cse29 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) .cse24)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse30 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse32) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 .cse2) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse34) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_31 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 .cse2) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse35 0)))) (not (= (select v_arrayElimArr_31 .cse2) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse36 .cse2) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse36 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse38) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse39 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse41 0)))))))) .cse47) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse48 .cse2) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse48 0)))))) (not .cse25) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse49 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse50) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and .cse7 .cse11 .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (not (= (select v_arrayElimArr_31 .cse2) 0)) (not (= .cse52 .cse2)) (= .cse52 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse14 .cse15) .cse25) .cse47 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse53 .cse2) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse54)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse55) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0)) (= .cse56 0)))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_31 .cse2) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse59) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) is different from false [2022-11-02 21:09:22,177 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse6 v_ArrVal_682)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (not (= 2 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse4) (= 2 .cse4)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 21:09:22,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse6 v_ArrVal_682)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse4 3) (= .cse4 2)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 21:09:24,202 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (select |c_#memory_int| .cse1))) (and (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) (= (select .cse3 .cse4) 2) .cse5))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (not (= 2 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse7 (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (or (= 2 .cse7) (= 3 .cse7))))))) .cse5 (= 2 (select .cse3 0))))) is different from false [2022-11-02 21:09:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:24,773 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-02 21:09:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:09:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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 27 [2022-11-02 21:09:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:24,774 INFO L225 Difference]: With dead ends: 76 [2022-11-02 21:09:24,774 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 21:09:24,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=184, Invalid=1400, Unknown=8, NotChecked=664, Total=2256 [2022-11-02 21:09:24,776 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:24,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 250 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 278 Unchecked, 0.2s Time] [2022-11-02 21:09:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 21:09:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-11-02 21:09:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-11-02 21:09:24,808 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2022-11-02 21:09:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:24,809 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-11-02 21:09:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 21:09:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-11-02 21:09:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 21:09:24,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:24,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:24,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 21:09:25,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1736025984, now seen corresponding path program 4 times [2022-11-02 21:09:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:25,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858315461] [2022-11-02 21:09:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:26,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858315461] [2022-11-02 21:09:26,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858315461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:26,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004377149] [2022-11-02 21:09:26,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:09:26,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:26,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:26,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0be0fa2-481b-4e74-9378-68d1d00704b6/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:09:26,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:09:26,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:09:26,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 21:09:26,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:26,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:09:26,446 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:09:26,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:09:26,526 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-02 21:09:26,531 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-02 21:09:26,622 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:09:26,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 21:09:26,629 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 5 treesize of output 3 [2022-11-02 21:09:26,646 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:09:26,646 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 31 treesize of output 29 [2022-11-02 21:09:26,707 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 21:09:26,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:09:26,796 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-02 21:09:26,797 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-11-02 21:09:26,802 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-11-02 21:09:26,935 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 21:09:26,935 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 132 [2022-11-02 21:09:26,958 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-02 21:09: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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 121 [2022-11-02 21:09:26,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-02 21:09:27,254 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 21:09:27,255 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 58 [2022-11-02 21:09:27,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2022-11-02 21:09:27,352 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:09:27,352 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 22 treesize of output 14 [2022-11-02 21:09:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:27,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:27,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:27,557 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 202 treesize of output 205 [2022-11-02 21:09:29,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-02 21:09:29,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-02 21:09:29,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-02 21:09:29,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-02 21:09:29,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-02 21:09:29,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-02 21:09:29,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-02 21:09:29,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:29,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-02 21:09:30,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,322 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 1 case distinctions, treesize of input 81 treesize of output 82 [2022-11-02 21:09:30,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,331 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 1 case distinctions, treesize of input 71 treesize of output 62 [2022-11-02 21:09:30,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2349 treesize of output 1686 [2022-11-02 21:09:30,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:30,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,510 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 1 case distinctions, treesize of input 704 treesize of output 601 [2022-11-02 21:09:30,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 603 treesize of output 467 [2022-11-02 21:09:30,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 400 [2022-11-02 21:09:30,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:30,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 348 [2022-11-02 21:09:39,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:39,573 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 1 case distinctions, treesize of input 85 treesize of output 86 [2022-11-02 21:09:39,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:39,582 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 1 case distinctions, treesize of input 99 treesize of output 90 [2022-11-02 21:09:39,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:39,597 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 665 treesize of output 466 [2022-11-02 21:09:39,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:09:40,018 INFO L356 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2022-11-02 21:09:40,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 2560 treesize of output 2313 [2022-11-02 21:09:40,143 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:40,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1133 treesize of output 837 [2022-11-02 21:09:40,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:40,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 499 treesize of output 443 [2022-11-02 21:09:40,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:40,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 646 treesize of output 622 [2022-11-02 21:09:40,302 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 109 treesize of output 77 [2022-11-02 21:09:45,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,442 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 1 case distinctions, treesize of input 81 treesize of output 82 [2022-11-02 21:09:45,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,452 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 1 case distinctions, treesize of input 71 treesize of output 62 [2022-11-02 21:09:45,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2412 treesize of output 1767 [2022-11-02 21:09:45,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,617 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 5646 treesize of output 5279 [2022-11-02 21:09:45,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5274 treesize of output 3638 [2022-11-02 21:09:45,736 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 3624 treesize of output 3128 [2022-11-02 21:09:45,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:45,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2942 treesize of output 2880 [2022-11-02 21:09:46,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:09:46,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2862 treesize of output 2900