./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:48:36,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:48:36,982 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:48:36,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:48:36,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:48:37,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:48:37,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:48:37,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:48:37,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:48:37,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:48:37,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:48:37,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:48:37,016 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:48:37,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:48:37,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:48:37,018 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:48:37,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:48:37,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:48:37,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:48:37,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:48:37,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:48:37,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:48:37,023 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:48:37,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:48:37,024 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:48:37,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:48:37,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:48:37,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:48:37,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:48:37,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:48:37,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:48:37,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:48:37,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:48:37,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:48:37,028 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:48:37,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:48:37,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:48:37,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:48:37,029 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:48:37,029 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:48:37,029 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:48:37,030 INFO L153 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_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/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_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2023-12-02 20:48:37,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:48:37,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:48:37,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:48:37,285 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:48:37,285 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:48:37,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 20:48:40,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:48:40,344 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:48:40,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 20:48:40,354 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/data/f520a0b1e/0c835a7596334c74a05c9c657d124c63/FLAGce290cd8f [2023-12-02 20:48:40,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/data/f520a0b1e/0c835a7596334c74a05c9c657d124c63 [2023-12-02 20:48:40,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:48:40,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:48:40,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:48:40,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:48:40,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:48:40,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504169ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40, skipping insertion in model container [2023-12-02 20:48:40,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,421 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:48:40,639 WARN L240 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_01571a85-1513-4a9c-ab72-9777cc3f8987/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 20:48:40,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:48:40,664 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:48:40,690 WARN L240 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_01571a85-1513-4a9c-ab72-9777cc3f8987/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 20:48:40,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:48:40,705 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:48:40,705 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:48:40,715 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:48:40,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40 WrapperNode [2023-12-02 20:48:40,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:48:40,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:48:40,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:48:40,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:48:40,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,767 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-12-02 20:48:40,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:48:40,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:48:40,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:48:40,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:48:40,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:48:40,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:48:40,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:48:40,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:48:40,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (1/1) ... [2023-12-02 20:48:40,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:48:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:40,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:48:40,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:48:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:48:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 20:48:40,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 20:48:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 20:48:40,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 20:48:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 20:48:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 20:48:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:48:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:48:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:48:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 20:48:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 20:48:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:48:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:48:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:48:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:48:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:48:40,898 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:48:41,020 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:48:41,022 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:48:41,322 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:48:41,526 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:48:41,526 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 20:48:41,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:48:41 BoogieIcfgContainer [2023-12-02 20:48:41,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:48:41,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:48:41,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:48:41,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:48:41,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:48:40" (1/3) ... [2023-12-02 20:48:41,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b497f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:48:41, skipping insertion in model container [2023-12-02 20:48:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:48:40" (2/3) ... [2023-12-02 20:48:41,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b497f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:48:41, skipping insertion in model container [2023-12-02 20:48:41,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:48:41" (3/3) ... [2023-12-02 20:48:41,536 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-12-02 20:48:41,545 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:48:41,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:48:41,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:48:41,558 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:48:41,614 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 20:48:41,661 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:48:41,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:48:41,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:41,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:48:41,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:48:41,709 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:48:41,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:48:41,729 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4ab31a6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:48:41,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 20:48:41,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 20:48:41,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -670110551, now seen corresponding path program 1 times [2023-12-02 20:48:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462486077] [2023-12-02 20:48:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:48:42,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462486077] [2023-12-02 20:48:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462486077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:48:42,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:48:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:48:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930481784] [2023-12-02 20:48:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:48:42,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:48:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:48:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:48:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:42,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:42,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:48:42,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:42,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:48:42,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 20:48:42,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1999076930, now seen corresponding path program 1 times [2023-12-02 20:48:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203156474] [2023-12-02 20:48:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:48:42,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203156474] [2023-12-02 20:48:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203156474] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:48:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655968667] [2023-12-02 20:48:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:42,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:42,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:48:42,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:48:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:42,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 20:48:42,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:48:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:48:43,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:48:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:48:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655968667] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:48:43,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:48:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-12-02 20:48:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937568037] [2023-12-02 20:48:43,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:48:43,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 20:48:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 20:48:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-02 20:48:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:43,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:43,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 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) [2023-12-02 20:48:43,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:43,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:43,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:48:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:43,628 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 20:48:43,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1155457079, now seen corresponding path program 2 times [2023-12-02 20:48:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403920307] [2023-12-02 20:48:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:43,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 20:48:43,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:43,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403920307] [2023-12-02 20:48:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403920307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:48:43,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:48:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:48:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428345969] [2023-12-02 20:48:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:48:43,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:48:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:48:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:48:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:43,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:43,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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) [2023-12-02 20:48:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:43,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:43,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:43,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:48:43,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 20:48:43,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash -644796601, now seen corresponding path program 1 times [2023-12-02 20:48:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103386134] [2023-12-02 20:48:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:48:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103386134] [2023-12-02 20:48:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103386134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:48:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733005764] [2023-12-02 20:48:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:44,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:44,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:48:44,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:48:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:44,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 20:48:44,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:48:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:48:44,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:48:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:48:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733005764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:48:44,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:48:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-12-02 20:48:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958041745] [2023-12-02 20:48:44,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:48:44,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 20:48:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 20:48:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-02 20:48:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:44,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:44,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:48:44,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:44,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:44,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:44,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:44,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 20:48:45,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:45,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 20:48:45,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1823484914, now seen corresponding path program 2 times [2023-12-02 20:48:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842416487] [2023-12-02 20:48:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:48:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842416487] [2023-12-02 20:48:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842416487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:48:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711582923] [2023-12-02 20:48:51,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:48:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:51,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:48:51,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:48:51,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:48:51,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:48:51,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-02 20:48:51,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:48:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:48:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:48:51,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:48:52,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:48:54,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:48:54,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 118 [2023-12-02 20:48:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:48:55,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:50:01,164 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse779 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse780 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse3 (+ c_~max2~0 1))) (let ((.cse46 (= c_~max1~0 c_~max2~0)) (.cse14 (< c_~max2~0 c_~max3~0)) (.cse50 (< c_~max3~0 .cse3)) (.cse45 (= c_~max1~0 c_~max3~0)) (.cse1 (+ c_~max1~0 1)) (.cse9 (+ c_~A~0.offset .cse780 8)) (.cse5 (+ c_~A~0.offset .cse780 4)) (.cse18 (+ c_~max3~0 1)) (.cse8 (+ .cse779 c_~A~0.offset)) (.cse11 (+ c_~A~0.offset .cse780)) (.cse10 (+ .cse779 c_~A~0.offset 4)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse0 (select .cse4 .cse11)) (.cse2 (select .cse4 .cse10)) (.cse7 (select .cse4 .cse9))) (or (< .cse0 .cse1) (< .cse2 .cse3) (< .cse0 (select .cse4 .cse5)) (< c_~max3~0 (select .cse4 .cse6)) (< .cse7 (+ .cse0 1)) (< c_~max2~0 (select .cse4 .cse8)) (< .cse2 c_~max3~0) (= .cse2 .cse7))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse11))) (or (< .cse12 .cse1) (= c_~max2~0 .cse12) (< .cse12 (select .cse13 .cse9)) (< .cse12 (select .cse13 .cse5)) (< c_~max3~0 (select .cse13 .cse6)) (< c_~max2~0 (select .cse13 .cse8)) (< c_~max2~0 (select .cse13 .cse10)))))) .cse14) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse10)) (.cse16 (select .cse17 .cse6))) (or (= c_~max1~0 .cse15) (< .cse15 .cse16) (< .cse15 .cse3) (< c_~max1~0 (select .cse17 .cse11)) (< .cse16 .cse18) (< c_~max2~0 (select .cse17 .cse8)) (< c_~max1~0 (select .cse17 .cse5)) (< c_~max1~0 (select .cse17 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse5))) (or (= .cse19 c_~max3~0) (< .cse19 (select .cse20 .cse9)) (= .cse19 c_~max2~0) (< c_~max1~0 (select .cse20 .cse11)) (< c_~max3~0 (select .cse20 .cse6)) (< c_~max2~0 (select .cse20 .cse8)) (< .cse19 .cse1) (< c_~max2~0 (select .cse20 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse11)) (.cse21 (select .cse23 .cse8))) (or (= .cse21 .cse22) (< .cse22 .cse1) (< .cse22 (select .cse23 .cse9)) (< .cse22 (select .cse23 .cse5)) (< .cse21 c_~max3~0) (< .cse21 .cse3) (< .cse21 (select .cse23 .cse10)) (< c_~max3~0 (select .cse23 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse11)) (.cse28 (select .cse26 .cse10)) (.cse29 (select .cse26 .cse8)) (.cse25 (select .cse26 .cse5)) (.cse27 (select .cse26 .cse6))) (or (< .cse24 .cse1) (< .cse25 (select .cse26 .cse9)) (< .cse27 (+ .cse28 1)) (< .cse29 .cse3) (< .cse25 (+ .cse24 1)) (< .cse28 (+ .cse29 1)) (< .cse27 .cse18) (= .cse25 .cse27))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse30 (select .cse32 .cse11)) (.cse33 (select .cse32 .cse8)) (.cse35 (select .cse32 .cse6)) (.cse31 (select .cse32 .cse5)) (.cse34 (select .cse32 .cse10))) (or (< .cse30 .cse1) (< .cse31 (select .cse32 .cse9)) (< .cse33 .cse3) (< .cse31 (+ .cse30 1)) (< .cse34 (+ .cse33 1)) (< .cse35 .cse18) (= .cse31 .cse35) (= .cse31 .cse34))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse38 (select .cse40 .cse9)) (.cse39 (select .cse40 .cse5)) (.cse37 (select .cse40 .cse11)) (.cse36 (select .cse40 .cse6))) (or (< c_~max2~0 .cse36) (< .cse37 .cse1) (= c_~max2~0 .cse38) (< .cse38 (+ .cse39 1)) (< .cse39 (+ .cse37 1)) (< .cse36 .cse18) (< c_~max2~0 (select .cse40 .cse8)) (< c_~max2~0 (select .cse40 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse6)) (.cse41 (select .cse43 .cse8))) (or (< .cse41 .cse42) (< c_~max1~0 (select .cse43 .cse11)) (< .cse41 .cse3) (< .cse41 (select .cse43 .cse10)) (< .cse42 .cse18) (= c_~max1~0 .cse41) (< c_~max1~0 (select .cse43 .cse5)) (< c_~max1~0 (select .cse43 .cse9)))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (or (< c_~max1~0 (select .cse44 .cse11)) (< c_~max3~0 (select .cse44 .cse6)) (< c_~max2~0 (select .cse44 .cse8)) (< c_~max1~0 (select .cse44 .cse5)) (< c_~max1~0 (select .cse44 .cse9)) (< c_~max2~0 (select .cse44 .cse10))))) (and .cse45 (<= .cse3 c_~max3~0)) (and .cse46 (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse48 (select .cse49 .cse11)) (.cse47 (select .cse49 .cse6))) (or (< c_~max2~0 .cse47) (< .cse48 .cse1) (= c_~max2~0 .cse48) (< .cse48 (select .cse49 .cse9)) (< .cse48 (select .cse49 .cse5)) (< .cse47 .cse18) (< c_~max2~0 (select .cse49 .cse8)) (< c_~max2~0 (select .cse49 .cse10)))))) (or .cse50 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse5))) (or (= .cse51 c_~max3~0) (< .cse51 (select .cse52 .cse9)) (< c_~max1~0 (select .cse52 .cse11)) (< c_~max3~0 (select .cse52 .cse6)) (< c_~max2~0 (select .cse52 .cse8)) (< .cse51 .cse1) (< c_~max2~0 (select .cse52 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse8)) (.cse53 (select .cse55 .cse6)) (.cse57 (select .cse55 .cse10)) (.cse54 (select .cse55 .cse9))) (or (= .cse53 .cse54) (< c_~max1~0 (select .cse55 .cse11)) (< .cse56 .cse3) (< .cse57 (+ .cse56 1)) (< .cse53 .cse18) (< c_~max1~0 (select .cse55 .cse5)) (< .cse54 .cse1) (= .cse57 .cse54))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse58 (select .cse59 .cse9))) (or (= c_~max2~0 .cse58) (< c_~max1~0 (select .cse59 .cse11)) (< c_~max3~0 (select .cse59 .cse6)) (< c_~max2~0 (select .cse59 .cse8)) (< c_~max1~0 (select .cse59 .cse5)) (< .cse58 .cse1) (= c_~max3~0 .cse58) (< c_~max2~0 (select .cse59 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse60 (select .cse61 .cse11))) (or (= c_~max3~0 .cse60) (< .cse60 .cse1) (= c_~max2~0 .cse60) (< .cse60 (select .cse61 .cse9)) (< .cse60 (select .cse61 .cse5)) (< c_~max3~0 (select .cse61 .cse6)) (< c_~max2~0 (select .cse61 .cse8)) (< c_~max2~0 (select .cse61 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse66 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse63 (select .cse66 .cse6)) (.cse65 (select .cse66 .cse5)) (.cse62 (select .cse66 .cse10)) (.cse64 (select .cse66 .cse9))) (or (< .cse62 .cse3) (= .cse63 .cse64) (< .cse64 (+ .cse65 1)) (< c_~max1~0 (select .cse66 .cse11)) (< .cse63 .cse18) (< c_~max2~0 (select .cse66 .cse8)) (< .cse65 .cse1) (= .cse62 .cse64))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse67 (select .cse69 .cse10)) (.cse70 (select .cse69 .cse8)) (.cse68 (select .cse69 .cse6))) (or (= c_~max1~0 .cse67) (= c_~max1~0 .cse68) (< c_~max1~0 (select .cse69 .cse11)) (< .cse70 .cse3) (< .cse67 (+ .cse70 1)) (< .cse68 .cse18) (< c_~max1~0 (select .cse69 .cse5)) (< c_~max1~0 (select .cse69 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse72 (select .cse74 .cse6)) (.cse71 (select .cse74 .cse10)) (.cse73 (select .cse74 .cse9))) (or (< .cse71 .cse3) (= .cse72 .cse73) (< c_~max1~0 (select .cse74 .cse11)) (< .cse72 .cse18) (< c_~max2~0 (select .cse74 .cse8)) (< c_~max1~0 (select .cse74 .cse5)) (< .cse73 .cse1) (= .cse71 .cse73))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse76 (select .cse77 .cse10)) (.cse75 (select .cse77 .cse11))) (or (= c_~max3~0 .cse75) (< .cse75 .cse1) (< .cse76 .cse3) (< .cse75 (select .cse77 .cse9)) (< .cse75 (select .cse77 .cse5)) (< c_~max3~0 (select .cse77 .cse6)) (= .cse76 .cse75) (< c_~max2~0 (select .cse77 .cse8)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse80 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse78 (select .cse80 .cse11)) (.cse79 (select .cse80 .cse5)) (.cse81 (select .cse80 .cse6))) (or (< .cse78 .cse1) (< .cse79 (select .cse80 .cse9)) (< .cse79 (+ .cse78 1)) (< .cse81 .cse18) (< c_~max2~0 (select .cse80 .cse8)) (< .cse81 .cse3) (= .cse79 .cse81) (< c_~max2~0 (select .cse80 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse87 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse86 (select .cse87 .cse5)) (.cse82 (select .cse87 .cse11)) (.cse84 (select .cse87 .cse6)) (.cse83 (select .cse87 .cse10)) (.cse85 (select .cse87 .cse9))) (or (< .cse82 .cse1) (< .cse83 .cse3) (= .cse84 .cse85) (< .cse85 (+ .cse86 1)) (< .cse86 (+ .cse82 1)) (< .cse84 .cse18) (< c_~max2~0 (select .cse87 .cse8)) (= .cse83 .cse85))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse91 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse89 (select .cse91 .cse10)) (.cse88 (select .cse91 .cse6)) (.cse90 (select .cse91 .cse9))) (or (< .cse88 (+ .cse89 1)) (< .cse89 .cse3) (= .cse88 .cse90) (< c_~max1~0 (select .cse91 .cse11)) (< .cse88 .cse18) (< c_~max2~0 (select .cse91 .cse8)) (< c_~max1~0 (select .cse91 .cse5)) (< .cse90 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse94 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse95 (select .cse94 .cse8)) (.cse92 (select .cse94 .cse11)) (.cse93 (select .cse94 .cse5)) (.cse96 (select .cse94 .cse6))) (or (< .cse92 .cse1) (< .cse93 (select .cse94 .cse9)) (= .cse95 .cse93) (< .cse95 .cse3) (< .cse95 (select .cse94 .cse10)) (< .cse93 (+ .cse92 1)) (< .cse96 .cse18) (= .cse93 .cse96))))) (or .cse14 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse99 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse98 (select .cse99 .cse9)) (.cse97 (select .cse99 .cse11))) (or (< .cse97 .cse1) (= c_~max2~0 .cse98) (< .cse97 (select .cse99 .cse5)) (< c_~max3~0 (select .cse99 .cse6)) (< .cse98 (+ .cse97 1)) (< c_~max2~0 (select .cse99 .cse8)) (< c_~max2~0 (select .cse99 .cse10))))))) (or .cse14 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse102 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse101 (select .cse102 .cse5)) (.cse100 (select .cse102 .cse11))) (or (< .cse100 .cse1) (< .cse101 (select .cse102 .cse9)) (= .cse101 c_~max2~0) (< .cse101 (+ .cse100 1)) (< c_~max3~0 (select .cse102 .cse6)) (< c_~max2~0 (select .cse102 .cse8)) (< c_~max2~0 (select .cse102 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse109 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse106 (select .cse109 .cse5)) (.cse103 (select .cse109 .cse11)) (.cse107 (select .cse109 .cse8)) (.cse104 (select .cse109 .cse6)) (.cse108 (select .cse109 .cse10)) (.cse105 (select .cse109 .cse9))) (or (< .cse103 .cse1) (= .cse104 .cse105) (< .cse105 (+ .cse106 1)) (< .cse107 .cse3) (< .cse106 (+ .cse103 1)) (< .cse108 (+ .cse107 1)) (< .cse104 .cse18) (= .cse108 .cse105))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse112 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse110 (select .cse112 .cse6)) (.cse111 (select .cse112 .cse5))) (or (< c_~max2~0 .cse110) (< .cse111 (select .cse112 .cse9)) (= .cse111 c_~max2~0) (< c_~max1~0 (select .cse112 .cse11)) (< .cse110 .cse18) (< c_~max2~0 (select .cse112 .cse8)) (< .cse111 .cse1) (< c_~max2~0 (select .cse112 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse115 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse113 (select .cse115 .cse11)) (.cse114 (select .cse115 .cse10))) (or (= c_~max3~0 .cse113) (< .cse113 .cse1) (< .cse114 .cse3) (< .cse113 (select .cse115 .cse9)) (< .cse113 (select .cse115 .cse5)) (< c_~max3~0 (+ .cse114 1)) (< c_~max3~0 (select .cse115 .cse6)) (< c_~max2~0 (select .cse115 .cse8)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse119 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse118 (select .cse119 .cse5)) (.cse116 (select .cse119 .cse11)) (.cse117 (select .cse119 .cse9))) (or (< .cse116 .cse1) (= c_~max2~0 .cse117) (< .cse117 (+ .cse118 1)) (< .cse118 (+ .cse116 1)) (< c_~max3~0 (select .cse119 .cse6)) (< c_~max2~0 (select .cse119 .cse8)) (= c_~max3~0 .cse117) (< c_~max2~0 (select .cse119 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse123 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse120 (select .cse123 .cse10)) (.cse122 (select .cse123 .cse5)) (.cse121 (select .cse123 .cse9))) (or (< .cse120 .cse3) (< .cse121 (+ .cse122 1)) (< c_~max1~0 (select .cse123 .cse11)) (< c_~max3~0 (+ .cse120 1)) (< c_~max3~0 (select .cse123 .cse6)) (< c_~max2~0 (select .cse123 .cse8)) (< .cse122 .cse1) (= c_~max3~0 .cse121))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse126 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse124 (select .cse126 .cse5)) (.cse125 (select .cse126 .cse11)) (.cse127 (select .cse126 .cse8))) (or (= .cse124 c_~max3~0) (< .cse125 .cse1) (< .cse124 (select .cse126 .cse9)) (< .cse127 .cse3) (< .cse127 (select .cse126 .cse10)) (< .cse124 (+ .cse125 1)) (< c_~max3~0 (select .cse126 .cse6)) (< c_~max3~0 (+ .cse127 1)))))) (or .cse50 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse131 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse130 (select .cse131 .cse5)) (.cse128 (select .cse131 .cse11)) (.cse129 (select .cse131 .cse9))) (or (< .cse128 .cse1) (< .cse129 (+ .cse130 1)) (< .cse130 (+ .cse128 1)) (< c_~max3~0 (select .cse131 .cse6)) (< c_~max2~0 (select .cse131 .cse8)) (= c_~max3~0 .cse129) (< c_~max2~0 (select .cse131 .cse10))))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse133 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse132 (select .cse133 .cse9))) (or (= c_~max2~0 .cse132) (< c_~max1~0 (select .cse133 .cse11)) (< c_~max3~0 (select .cse133 .cse6)) (< c_~max2~0 (select .cse133 .cse8)) (< c_~max1~0 (select .cse133 .cse5)) (< .cse132 .cse1) (< c_~max2~0 (select .cse133 .cse10)))))) .cse14) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse138 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse135 (select .cse138 .cse8)) (.cse137 (select .cse138 .cse5)) (.cse134 (select .cse138 .cse11)) (.cse136 (select .cse138 .cse6))) (or (< .cse134 .cse1) (< .cse135 .cse136) (< .cse137 (select .cse138 .cse9)) (= .cse135 .cse137) (< .cse135 .cse3) (< .cse135 (select .cse138 .cse10)) (< .cse137 (+ .cse134 1)) (< .cse136 .cse18))))) (or .cse14 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse140 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse139 (select .cse140 .cse5))) (or (< .cse139 (select .cse140 .cse9)) (= .cse139 c_~max2~0) (< c_~max1~0 (select .cse140 .cse11)) (< c_~max3~0 (select .cse140 .cse6)) (< c_~max2~0 (select .cse140 .cse8)) (< .cse139 .cse1) (< c_~max2~0 (select .cse140 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse143 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse142 (select .cse143 .cse6)) (.cse141 (select .cse143 .cse8)) (.cse144 (select .cse143 .cse9))) (or (< .cse141 .cse142) (< c_~max1~0 (select .cse143 .cse11)) (< .cse141 .cse3) (< .cse141 (select .cse143 .cse10)) (< .cse142 .cse18) (< c_~max1~0 (select .cse143 .cse5)) (< .cse144 .cse1) (= .cse141 .cse144))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse149 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse146 (select .cse149 .cse10)) (.cse147 (select .cse149 .cse9)) (.cse145 (select .cse149 .cse6)) (.cse148 (select .cse149 .cse5))) (or (< .cse145 (+ .cse146 1)) (< .cse146 .cse3) (= .cse145 .cse147) (< .cse147 (+ .cse148 1)) (< c_~max1~0 (select .cse149 .cse11)) (< .cse145 .cse18) (< c_~max2~0 (select .cse149 .cse8)) (< .cse148 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse155 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse152 (select .cse155 .cse5)) (.cse150 (select .cse155 .cse11)) (.cse153 (select .cse155 .cse8)) (.cse154 (select .cse155 .cse10)) (.cse151 (select .cse155 .cse9))) (or (< .cse150 .cse1) (< .cse151 (+ .cse152 1)) (< .cse153 .cse3) (< .cse152 (+ .cse150 1)) (< .cse154 (+ .cse153 1)) (< c_~max3~0 (select .cse155 .cse6)) (< .cse154 c_~max3~0) (= .cse154 .cse151))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse161 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse158 (select .cse161 .cse10)) (.cse159 (select .cse161 .cse9)) (.cse160 (select .cse161 .cse5)) (.cse156 (select .cse161 .cse11)) (.cse157 (select .cse161 .cse6))) (or (< .cse156 .cse1) (< .cse157 (+ .cse158 1)) (< .cse158 .cse3) (= .cse157 .cse159) (< .cse159 (+ .cse160 1)) (< .cse160 (+ .cse156 1)) (< .cse157 .cse18) (< c_~max2~0 (select .cse161 .cse8)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse164 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse163 (select .cse164 .cse10)) (.cse165 (select .cse164 .cse8)) (.cse162 (select .cse164 .cse6))) (or (= c_~max1~0 .cse162) (< .cse162 (+ .cse163 1)) (< c_~max1~0 (select .cse164 .cse11)) (< .cse165 .cse3) (< .cse163 (+ .cse165 1)) (< .cse162 .cse18) (< c_~max1~0 (select .cse164 .cse5)) (< c_~max1~0 (select .cse164 .cse9)))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse166 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse167 (select .cse166 .cse9))) (or (< c_~max1~0 (select .cse166 .cse11)) (< c_~max3~0 (select .cse166 .cse6)) (< c_~max2~0 (select .cse166 .cse8)) (< c_~max1~0 (select .cse166 .cse5)) (< .cse167 .cse1) (= c_~max3~0 .cse167) (< c_~max2~0 (select .cse166 .cse10)))))) .cse50) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse170 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse169 (select .cse170 .cse6)) (.cse168 (select .cse170 .cse10)) (.cse171 (select .cse170 .cse9))) (or (< .cse168 .cse169) (< .cse168 .cse3) (< c_~max1~0 (select .cse170 .cse11)) (< .cse169 .cse18) (< c_~max2~0 (select .cse170 .cse8)) (< c_~max1~0 (select .cse170 .cse5)) (< .cse171 .cse1) (= .cse168 .cse171))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse173 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse174 (select .cse173 .cse8)) (.cse172 (select .cse173 .cse5)) (.cse175 (select .cse173 .cse10))) (or (= .cse172 c_~max3~0) (< .cse172 (select .cse173 .cse9)) (< c_~max1~0 (select .cse173 .cse11)) (< .cse174 .cse3) (< .cse175 (+ .cse174 1)) (< c_~max3~0 (select .cse173 .cse6)) (< .cse172 .cse1) (= .cse172 .cse175))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse177 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse176 (select .cse177 .cse10)) (.cse178 (select .cse177 .cse9))) (or (< .cse176 .cse3) (< c_~max1~0 (select .cse177 .cse11)) (< c_~max3~0 (select .cse177 .cse6)) (< c_~max2~0 (select .cse177 .cse8)) (< c_~max1~0 (select .cse177 .cse5)) (< .cse178 .cse1) (= c_~max3~0 .cse178) (= .cse176 .cse178))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse182 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse180 (select .cse182 .cse9)) (.cse181 (select .cse182 .cse5)) (.cse179 (select .cse182 .cse6))) (or (= .cse179 .cse180) (< .cse180 (+ .cse181 1)) (< c_~max1~0 (select .cse182 .cse11)) (< .cse179 .cse18) (< c_~max2~0 (select .cse182 .cse8)) (< .cse181 .cse1) (< .cse179 .cse3) (< c_~max2~0 (select .cse182 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse184 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse185 (select .cse184 .cse8)) (.cse183 (select .cse184 .cse10))) (or (= c_~max1~0 .cse183) (< c_~max1~0 (select .cse184 .cse11)) (< .cse185 .cse3) (< .cse183 (+ .cse185 1)) (< c_~max3~0 (select .cse184 .cse6)) (< .cse183 c_~max3~0) (< c_~max1~0 (select .cse184 .cse5)) (< c_~max1~0 (select .cse184 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse189 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse186 (select .cse189 .cse6)) (.cse188 (select .cse189 .cse9)) (.cse187 (select .cse189 .cse11))) (or (< c_~max2~0 .cse186) (< .cse187 .cse1) (= c_~max2~0 .cse188) (< .cse187 (select .cse189 .cse5)) (< .cse186 .cse18) (< .cse188 (+ .cse187 1)) (< c_~max2~0 (select .cse189 .cse8)) (< c_~max2~0 (select .cse189 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse192 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse191 (select .cse192 .cse9)) (.cse190 (select .cse192 .cse6))) (or (= .cse190 .cse191) (< c_~max1~0 (select .cse192 .cse11)) (< .cse190 .cse18) (< c_~max2~0 (select .cse192 .cse8)) (< c_~max1~0 (select .cse192 .cse5)) (< .cse191 .cse1) (< .cse190 .cse3) (< c_~max2~0 (select .cse192 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse194 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse195 (select .cse194 .cse8)) (.cse193 (select .cse194 .cse11)) (.cse196 (select .cse194 .cse10))) (or (< .cse193 .cse1) (< .cse193 (select .cse194 .cse9)) (< .cse193 (select .cse194 .cse5)) (< .cse195 .cse3) (< .cse196 (+ .cse195 1)) (< c_~max3~0 (select .cse194 .cse6)) (= .cse196 .cse193) (< .cse196 c_~max3~0))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse198 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse200 (select .cse198 .cse8)) (.cse197 (select .cse198 .cse5)) (.cse199 (select .cse198 .cse6))) (or (< .cse197 (select .cse198 .cse9)) (< .cse199 (+ .cse200 1)) (< c_~max1~0 (select .cse198 .cse11)) (< .cse200 .cse3) (< .cse200 (select .cse198 .cse10)) (< .cse199 .cse18) (< .cse197 .cse1) (= .cse197 .cse199))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse202 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse201 (select .cse202 .cse5)) (.cse203 (select .cse202 .cse6))) (or (< .cse201 (select .cse202 .cse9)) (< c_~max1~0 (select .cse202 .cse11)) (< .cse203 .cse18) (< c_~max2~0 (select .cse202 .cse8)) (< .cse201 .cse1) (< .cse203 .cse3) (= .cse201 .cse203) (< c_~max2~0 (select .cse202 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse208 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse205 (select .cse208 .cse9)) (.cse207 (select .cse208 .cse5)) (.cse204 (select .cse208 .cse11)) (.cse206 (select .cse208 .cse6))) (or (< .cse204 .cse1) (= c_~max2~0 .cse205) (= .cse206 .cse205) (< .cse205 (+ .cse207 1)) (< .cse207 (+ .cse204 1)) (< .cse206 .cse18) (< c_~max2~0 (select .cse208 .cse8)) (< c_~max2~0 (select .cse208 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse210 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse211 (select .cse210 .cse8)) (.cse213 (select .cse210 .cse6)) (.cse209 (select .cse210 .cse5)) (.cse212 (select .cse210 .cse10))) (or (< .cse209 (select .cse210 .cse9)) (< c_~max1~0 (select .cse210 .cse11)) (< .cse211 .cse3) (< .cse212 (+ .cse211 1)) (< .cse213 .cse18) (< .cse209 .cse1) (= .cse209 .cse213) (= .cse209 .cse212))))) (or .cse46 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse215 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse214 (select .cse215 .cse6))) (or (= c_~max1~0 .cse214) (< c_~max1~0 (select .cse215 .cse11)) (< .cse214 .cse18) (< c_~max2~0 (select .cse215 .cse8)) (< c_~max1~0 (select .cse215 .cse5)) (< c_~max1~0 (select .cse215 .cse9)) (< c_~max2~0 (select .cse215 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse217 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse218 (select .cse217 .cse8)) (.cse216 (select .cse217 .cse5)) (.cse219 (select .cse217 .cse10))) (or (< .cse216 (select .cse217 .cse9)) (< c_~max1~0 (select .cse217 .cse11)) (< .cse218 .cse3) (< .cse219 (+ .cse218 1)) (< c_~max3~0 (select .cse217 .cse6)) (< .cse219 c_~max3~0) (< .cse216 .cse1) (= .cse216 .cse219))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse221 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse220 (select .cse221 .cse5)) (.cse222 (select .cse221 .cse6))) (or (< .cse220 (select .cse221 .cse9)) (= .cse220 c_~max2~0) (< c_~max1~0 (select .cse221 .cse11)) (< .cse222 .cse18) (< c_~max2~0 (select .cse221 .cse8)) (< .cse220 .cse1) (= .cse220 .cse222) (< c_~max2~0 (select .cse221 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse225 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse227 (select .cse225 .cse10)) (.cse223 (select .cse225 .cse11)) (.cse224 (select .cse225 .cse5)) (.cse226 (select .cse225 .cse6))) (or (< .cse223 .cse1) (< .cse224 (select .cse225 .cse9)) (< .cse226 (+ .cse227 1)) (< .cse227 .cse3) (< .cse224 (+ .cse223 1)) (< .cse226 .cse18) (< c_~max2~0 (select .cse225 .cse8)) (= .cse224 .cse226))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse230 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse229 (select .cse230 .cse6)) (.cse228 (select .cse230 .cse9))) (or (= c_~max2~0 .cse228) (= .cse229 .cse228) (< c_~max1~0 (select .cse230 .cse11)) (< .cse229 .cse18) (< c_~max2~0 (select .cse230 .cse8)) (< c_~max1~0 (select .cse230 .cse5)) (< .cse228 .cse1) (< c_~max2~0 (select .cse230 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse236 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse235 (select .cse236 .cse5)) (.cse231 (select .cse236 .cse11)) (.cse233 (select .cse236 .cse6)) (.cse232 (select .cse236 .cse8)) (.cse234 (select .cse236 .cse9))) (or (< .cse231 .cse1) (< .cse232 .cse233) (< .cse234 (+ .cse235 1)) (< .cse232 .cse3) (< .cse232 (select .cse236 .cse10)) (< .cse235 (+ .cse231 1)) (< .cse233 .cse18) (= .cse232 .cse234))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse240 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse241 (select .cse240 .cse8)) (.cse239 (select .cse240 .cse6)) (.cse237 (select .cse240 .cse11)) (.cse238 (select .cse240 .cse10)) (.cse242 (select .cse240 .cse9))) (or (< .cse237 .cse1) (< .cse238 .cse239) (< .cse237 (select .cse240 .cse5)) (< .cse241 .cse3) (< .cse238 (+ .cse241 1)) (< .cse239 .cse18) (< .cse242 (+ .cse237 1)) (= .cse238 .cse242))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse244 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse246 (select .cse244 .cse6)) (.cse243 (select .cse244 .cse5)) (.cse245 (select .cse244 .cse10))) (or (< .cse243 (select .cse244 .cse9)) (< .cse245 .cse246) (< .cse245 .cse3) (< c_~max1~0 (select .cse244 .cse11)) (< .cse246 .cse18) (< c_~max2~0 (select .cse244 .cse8)) (< .cse243 .cse1) (= .cse243 .cse245))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse249 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse250 (select .cse249 .cse8)) (.cse247 (select .cse249 .cse5)) (.cse248 (select .cse249 .cse11))) (or (= .cse247 c_~max3~0) (< .cse248 .cse1) (< .cse247 (select .cse249 .cse9)) (= .cse250 .cse247) (< .cse250 .cse3) (< .cse250 (select .cse249 .cse10)) (< .cse247 (+ .cse248 1)) (< c_~max3~0 (select .cse249 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse255 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse253 (select .cse255 .cse9)) (.cse252 (select .cse255 .cse8)) (.cse251 (select .cse255 .cse6)) (.cse254 (select .cse255 .cse5))) (or (< .cse251 (+ .cse252 1)) (= .cse251 .cse253) (< .cse253 (+ .cse254 1)) (< c_~max1~0 (select .cse255 .cse11)) (< .cse252 .cse3) (< .cse252 (select .cse255 .cse10)) (< .cse251 .cse18) (< .cse254 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse257 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse256 (select .cse257 .cse8))) (or (< .cse256 c_~max3~0) (< c_~max1~0 (select .cse257 .cse11)) (< .cse256 .cse3) (< .cse256 (select .cse257 .cse10)) (< c_~max3~0 (select .cse257 .cse6)) (= c_~max1~0 .cse256) (< c_~max1~0 (select .cse257 .cse5)) (< c_~max1~0 (select .cse257 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse259 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse261 (select .cse259 .cse6)) (.cse258 (select .cse259 .cse5)) (.cse260 (select .cse259 .cse10))) (or (< .cse258 (select .cse259 .cse9)) (< .cse260 .cse3) (< c_~max1~0 (select .cse259 .cse11)) (< .cse261 .cse18) (< c_~max2~0 (select .cse259 .cse8)) (< .cse258 .cse1) (= .cse258 .cse261) (= .cse258 .cse260))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse266 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse264 (select .cse266 .cse10)) (.cse263 (select .cse266 .cse6)) (.cse265 (select .cse266 .cse9)) (.cse262 (select .cse266 .cse11))) (or (< .cse262 .cse1) (< .cse263 (+ .cse264 1)) (< .cse264 .cse3) (= .cse263 .cse265) (< .cse262 (select .cse266 .cse5)) (< .cse263 .cse18) (< .cse265 (+ .cse262 1)) (< c_~max2~0 (select .cse266 .cse8)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse271 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse269 (select .cse271 .cse9)) (.cse268 (select .cse271 .cse10)) (.cse272 (select .cse271 .cse8)) (.cse267 (select .cse271 .cse6)) (.cse270 (select .cse271 .cse5))) (or (< .cse267 (+ .cse268 1)) (= .cse267 .cse269) (< .cse269 (+ .cse270 1)) (< c_~max1~0 (select .cse271 .cse11)) (< .cse272 .cse3) (< .cse268 (+ .cse272 1)) (< .cse267 .cse18) (< .cse270 .cse1))))) (or .cse50 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse274 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse273 (select .cse274 .cse11)) (.cse275 (select .cse274 .cse9))) (or (< .cse273 .cse1) (< .cse273 (select .cse274 .cse5)) (< c_~max3~0 (select .cse274 .cse6)) (< .cse275 (+ .cse273 1)) (< c_~max2~0 (select .cse274 .cse8)) (= c_~max3~0 .cse275) (< c_~max2~0 (select .cse274 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse278 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse277 (select .cse278 .cse5)) (.cse276 (select .cse278 .cse9))) (or (= c_~max2~0 .cse276) (< .cse276 (+ .cse277 1)) (< c_~max1~0 (select .cse278 .cse11)) (< c_~max3~0 (select .cse278 .cse6)) (< c_~max2~0 (select .cse278 .cse8)) (< .cse277 .cse1) (= c_~max3~0 .cse276) (< c_~max2~0 (select .cse278 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse280 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse279 (select .cse280 .cse11)) (.cse281 (select .cse280 .cse8)) (.cse282 (select .cse280 .cse9))) (or (< .cse279 .cse1) (< .cse279 (select .cse280 .cse5)) (< .cse281 .cse3) (< .cse281 (select .cse280 .cse10)) (< c_~max3~0 (select .cse280 .cse6)) (< .cse282 (+ .cse279 1)) (< c_~max3~0 (+ .cse281 1)) (= c_~max3~0 .cse282))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse284 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse285 (select .cse284 .cse8)) (.cse286 (select .cse284 .cse10)) (.cse287 (select .cse284 .cse6)) (.cse283 (select .cse284 .cse11))) (or (< .cse283 .cse1) (< .cse283 (select .cse284 .cse9)) (< .cse283 (select .cse284 .cse5)) (< .cse285 .cse3) (< .cse286 (+ .cse285 1)) (< .cse287 .cse18) (= .cse286 .cse283) (= .cse287 .cse283))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse292 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse291 (select .cse292 .cse5)) (.cse288 (select .cse292 .cse11)) (.cse289 (select .cse292 .cse10)) (.cse290 (select .cse292 .cse9))) (or (< .cse288 .cse1) (< .cse289 .cse3) (< .cse290 (+ .cse291 1)) (< .cse291 (+ .cse288 1)) (< c_~max3~0 (+ .cse289 1)) (< c_~max3~0 (select .cse292 .cse6)) (< c_~max2~0 (select .cse292 .cse8)) (= c_~max3~0 .cse290))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse295 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse296 (select .cse295 .cse8)) (.cse294 (select .cse295 .cse5)) (.cse297 (select .cse295 .cse10)) (.cse293 (select .cse295 .cse9))) (or (< .cse293 (+ .cse294 1)) (< c_~max1~0 (select .cse295 .cse11)) (< .cse296 .cse3) (< .cse297 (+ .cse296 1)) (< c_~max3~0 (select .cse295 .cse6)) (< .cse294 .cse1) (= c_~max3~0 .cse293) (= .cse297 .cse293))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse299 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse298 (select .cse299 .cse8)) (.cse300 (select .cse299 .cse9))) (or (< .cse298 c_~max3~0) (< c_~max1~0 (select .cse299 .cse11)) (< .cse298 .cse3) (< .cse298 (select .cse299 .cse10)) (< c_~max3~0 (select .cse299 .cse6)) (< c_~max1~0 (select .cse299 .cse5)) (< .cse300 .cse1) (= .cse298 .cse300))))) (or .cse46 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse302 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse301 (select .cse302 .cse6))) (or (< c_~max2~0 .cse301) (< c_~max1~0 (select .cse302 .cse11)) (< .cse301 .cse18) (< c_~max2~0 (select .cse302 .cse8)) (< c_~max1~0 (select .cse302 .cse5)) (< c_~max1~0 (select .cse302 .cse9)) (< c_~max2~0 (select .cse302 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse304 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse303 (select .cse304 .cse11)) (.cse305 (select .cse304 .cse8))) (or (= c_~max3~0 .cse303) (< .cse303 .cse1) (< .cse303 (select .cse304 .cse9)) (< .cse303 (select .cse304 .cse5)) (< .cse305 .cse3) (< .cse305 (select .cse304 .cse10)) (< c_~max3~0 (select .cse304 .cse6)) (< c_~max3~0 (+ .cse305 1)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse311 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse308 (select .cse311 .cse5)) (.cse306 (select .cse311 .cse11)) (.cse309 (select .cse311 .cse8)) (.cse310 (select .cse311 .cse10)) (.cse307 (select .cse311 .cse9))) (or (< .cse306 .cse1) (< .cse307 (+ .cse308 1)) (< .cse309 .cse3) (< .cse308 (+ .cse306 1)) (< .cse310 (+ .cse309 1)) (< c_~max3~0 (+ .cse310 1)) (< c_~max3~0 (select .cse311 .cse6)) (= c_~max3~0 .cse307))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse314 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse312 (select .cse314 .cse5)) (.cse313 (select .cse314 .cse11)) (.cse315 (select .cse314 .cse8)) (.cse316 (select .cse314 .cse10))) (or (= .cse312 c_~max3~0) (< .cse313 .cse1) (< .cse312 (select .cse314 .cse9)) (< .cse315 .cse3) (< .cse312 (+ .cse313 1)) (< .cse316 (+ .cse315 1)) (< c_~max3~0 (+ .cse316 1)) (< c_~max3~0 (select .cse314 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse318 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse319 (select .cse318 .cse10)) (.cse317 (select .cse318 .cse5))) (or (= .cse317 c_~max3~0) (< .cse317 (select .cse318 .cse9)) (< .cse319 .cse3) (< c_~max1~0 (select .cse318 .cse11)) (< c_~max3~0 (+ .cse319 1)) (< c_~max3~0 (select .cse318 .cse6)) (< c_~max2~0 (select .cse318 .cse8)) (< .cse317 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse321 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse322 (select .cse321 .cse8)) (.cse323 (select .cse321 .cse10)) (.cse320 (select .cse321 .cse11))) (or (= c_~max3~0 .cse320) (< .cse320 .cse1) (< .cse320 (select .cse321 .cse9)) (< .cse320 (select .cse321 .cse5)) (< .cse322 .cse3) (< .cse323 (+ .cse322 1)) (< c_~max3~0 (select .cse321 .cse6)) (= .cse323 .cse320))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse325 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse327 (select .cse325 .cse10)) (.cse324 (select .cse325 .cse5)) (.cse326 (select .cse325 .cse6))) (or (< .cse324 (select .cse325 .cse9)) (< .cse326 (+ .cse327 1)) (< .cse327 .cse3) (< c_~max1~0 (select .cse325 .cse11)) (< .cse326 .cse18) (< c_~max2~0 (select .cse325 .cse8)) (< .cse324 .cse1) (= .cse324 .cse326))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse330 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse329 (select .cse330 .cse8)) (.cse328 (select .cse330 .cse6))) (or (= c_~max1~0 .cse328) (< .cse328 (+ .cse329 1)) (< c_~max1~0 (select .cse330 .cse11)) (< .cse329 .cse3) (< .cse329 (select .cse330 .cse10)) (< .cse328 .cse18) (< c_~max1~0 (select .cse330 .cse5)) (< c_~max1~0 (select .cse330 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse332 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse333 (select .cse332 .cse6)) (.cse331 (select .cse332 .cse11))) (or (< .cse331 .cse1) (= c_~max2~0 .cse331) (< .cse331 (select .cse332 .cse9)) (< .cse331 (select .cse332 .cse5)) (< .cse333 .cse18) (< c_~max2~0 (select .cse332 .cse8)) (= .cse333 .cse331) (< c_~max2~0 (select .cse332 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse335 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse336 (select .cse335 .cse8)) (.cse337 (select .cse335 .cse10)) (.cse334 (select .cse335 .cse5))) (or (= .cse334 c_~max3~0) (< .cse334 (select .cse335 .cse9)) (< c_~max1~0 (select .cse335 .cse11)) (< .cse336 .cse3) (< .cse337 (+ .cse336 1)) (< c_~max3~0 (+ .cse337 1)) (< c_~max3~0 (select .cse335 .cse6)) (< .cse334 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse342 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse343 (select .cse342 .cse8)) (.cse339 (select .cse342 .cse6)) (.cse341 (select .cse342 .cse5)) (.cse338 (select .cse342 .cse10)) (.cse340 (select .cse342 .cse9))) (or (< .cse338 .cse339) (< .cse340 (+ .cse341 1)) (< c_~max1~0 (select .cse342 .cse11)) (< .cse343 .cse3) (< .cse338 (+ .cse343 1)) (< .cse339 .cse18) (< .cse341 .cse1) (= .cse338 .cse340))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse348 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse346 (select .cse348 .cse5)) (.cse344 (select .cse348 .cse11)) (.cse347 (select .cse348 .cse8)) (.cse345 (select .cse348 .cse9))) (or (< .cse344 .cse1) (< .cse345 (+ .cse346 1)) (< .cse347 .cse3) (< .cse347 (select .cse348 .cse10)) (< .cse346 (+ .cse344 1)) (< c_~max3~0 (select .cse348 .cse6)) (= c_~max3~0 .cse345) (= .cse347 .cse345))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse353 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse352 (select .cse353 .cse5)) (.cse349 (select .cse353 .cse11)) (.cse350 (select .cse353 .cse10)) (.cse351 (select .cse353 .cse9))) (or (< .cse349 .cse1) (< .cse350 .cse3) (< .cse351 (+ .cse352 1)) (< .cse352 (+ .cse349 1)) (< c_~max3~0 (select .cse353 .cse6)) (< c_~max2~0 (select .cse353 .cse8)) (< .cse350 c_~max3~0) (= .cse350 .cse351))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse356 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse354 (select .cse356 .cse5)) (.cse355 (select .cse356 .cse11))) (or (= .cse354 c_~max3~0) (< .cse355 .cse1) (< .cse354 (select .cse356 .cse9)) (< .cse354 (+ .cse355 1)) (< c_~max3~0 (select .cse356 .cse6)) (< c_~max2~0 (select .cse356 .cse8)) (< c_~max2~0 (select .cse356 .cse10)))))) .cse50) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse359 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse357 (select .cse359 .cse11)) (.cse362 (select .cse359 .cse8)) (.cse361 (select .cse359 .cse6)) (.cse358 (select .cse359 .cse5)) (.cse360 (select .cse359 .cse10))) (or (< .cse357 .cse1) (< .cse358 (select .cse359 .cse9)) (< .cse360 .cse361) (< .cse362 .cse3) (< .cse358 (+ .cse357 1)) (< .cse360 (+ .cse362 1)) (< .cse361 .cse18) (= .cse358 .cse360))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse365 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse363 (select .cse365 .cse5)) (.cse364 (select .cse365 .cse11))) (or (= .cse363 c_~max3~0) (< .cse364 .cse1) (< .cse363 (select .cse365 .cse9)) (= .cse363 c_~max2~0) (< .cse363 (+ .cse364 1)) (< c_~max3~0 (select .cse365 .cse6)) (< c_~max2~0 (select .cse365 .cse8)) (< c_~max2~0 (select .cse365 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse369 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse368 (select .cse369 .cse5)) (.cse366 (select .cse369 .cse10)) (.cse367 (select .cse369 .cse9))) (or (< .cse366 .cse3) (< .cse367 (+ .cse368 1)) (< c_~max1~0 (select .cse369 .cse11)) (< c_~max3~0 (select .cse369 .cse6)) (< c_~max2~0 (select .cse369 .cse8)) (< .cse368 .cse1) (= c_~max3~0 .cse367) (= .cse366 .cse367))))) (or .cse50 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse371 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse370 (select .cse371 .cse11))) (or (= c_~max3~0 .cse370) (< .cse370 .cse1) (< .cse370 (select .cse371 .cse9)) (< .cse370 (select .cse371 .cse5)) (< c_~max3~0 (select .cse371 .cse6)) (< c_~max2~0 (select .cse371 .cse8)) (< c_~max2~0 (select .cse371 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse374 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse375 (select .cse374 .cse8)) (.cse373 (select .cse374 .cse6)) (.cse372 (select .cse374 .cse10)) (.cse376 (select .cse374 .cse9))) (or (< .cse372 .cse373) (< c_~max1~0 (select .cse374 .cse11)) (< .cse375 .cse3) (< .cse372 (+ .cse375 1)) (< .cse373 .cse18) (< c_~max1~0 (select .cse374 .cse5)) (< .cse376 .cse1) (= .cse372 .cse376))))) (or .cse14 (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse379 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse377 (select .cse379 .cse9)) (.cse378 (select .cse379 .cse5))) (or (= c_~max2~0 .cse377) (< .cse377 (+ .cse378 1)) (< c_~max1~0 (select .cse379 .cse11)) (< c_~max3~0 (select .cse379 .cse6)) (< c_~max2~0 (select .cse379 .cse8)) (< .cse378 .cse1) (< c_~max2~0 (select .cse379 .cse10))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse383 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse384 (select .cse383 .cse8)) (.cse382 (select .cse383 .cse6)) (.cse381 (select .cse383 .cse10)) (.cse380 (select .cse383 .cse11))) (or (< .cse380 .cse1) (< .cse381 .cse382) (< .cse380 (select .cse383 .cse9)) (< .cse380 (select .cse383 .cse5)) (< .cse384 .cse3) (< .cse381 (+ .cse384 1)) (< .cse382 .cse18) (= .cse381 .cse380))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse388 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse386 (select .cse388 .cse5)) (.cse387 (select .cse388 .cse8)) (.cse385 (select .cse388 .cse9))) (or (< .cse385 (+ .cse386 1)) (< .cse387 c_~max3~0) (< c_~max1~0 (select .cse388 .cse11)) (< .cse387 .cse3) (< .cse387 (select .cse388 .cse10)) (< c_~max3~0 (select .cse388 .cse6)) (< .cse386 .cse1) (= .cse387 .cse385))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse392 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse391 (select .cse392 .cse5)) (.cse389 (select .cse392 .cse10)) (.cse390 (select .cse392 .cse9))) (or (< .cse389 .cse3) (< .cse390 (+ .cse391 1)) (< c_~max1~0 (select .cse392 .cse11)) (< c_~max3~0 (select .cse392 .cse6)) (< c_~max2~0 (select .cse392 .cse8)) (< .cse389 c_~max3~0) (< .cse391 .cse1) (= .cse389 .cse390))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse396 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse394 (select .cse396 .cse10)) (.cse397 (select .cse396 .cse8)) (.cse393 (select .cse396 .cse6)) (.cse395 (select .cse396 .cse9))) (or (< .cse393 (+ .cse394 1)) (= .cse393 .cse395) (< c_~max1~0 (select .cse396 .cse11)) (< .cse397 .cse3) (< .cse394 (+ .cse397 1)) (< .cse393 .cse18) (< c_~max1~0 (select .cse396 .cse5)) (< .cse395 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse400 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse398 (select .cse400 .cse11)) (.cse402 (select .cse400 .cse6)) (.cse399 (select .cse400 .cse5)) (.cse401 (select .cse400 .cse10))) (or (< .cse398 .cse1) (< .cse399 (select .cse400 .cse9)) (< .cse401 .cse3) (< .cse399 (+ .cse398 1)) (< .cse402 .cse18) (< c_~max2~0 (select .cse400 .cse8)) (= .cse399 .cse402) (= .cse399 .cse401))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse405 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse403 (select .cse405 .cse10)) (.cse406 (select .cse405 .cse8)) (.cse404 (select .cse405 .cse6))) (or (= c_~max1~0 .cse403) (< .cse403 .cse404) (< c_~max1~0 (select .cse405 .cse11)) (< .cse406 .cse3) (< .cse403 (+ .cse406 1)) (< .cse404 .cse18) (< c_~max1~0 (select .cse405 .cse5)) (< c_~max1~0 (select .cse405 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse409 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse410 (select .cse409 .cse8)) (.cse408 (select .cse409 .cse5)) (.cse407 (select .cse409 .cse11))) (or (< .cse407 .cse1) (< .cse408 (select .cse409 .cse9)) (< .cse410 c_~max3~0) (= .cse410 .cse408) (< .cse410 .cse3) (< .cse410 (select .cse409 .cse10)) (< .cse408 (+ .cse407 1)) (< c_~max3~0 (select .cse409 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse413 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse411 (select .cse413 .cse6)) (.cse412 (select .cse413 .cse9))) (or (< c_~max2~0 .cse411) (= c_~max2~0 .cse412) (< c_~max1~0 (select .cse413 .cse11)) (< .cse411 .cse18) (< c_~max2~0 (select .cse413 .cse8)) (< c_~max1~0 (select .cse413 .cse5)) (< .cse412 .cse1) (< c_~max2~0 (select .cse413 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse415 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse416 (select .cse415 .cse8)) (.cse417 (select .cse415 .cse10)) (.cse414 (select .cse415 .cse11)) (.cse418 (select .cse415 .cse9))) (or (< .cse414 .cse1) (< .cse414 (select .cse415 .cse5)) (< .cse416 .cse3) (< .cse417 (+ .cse416 1)) (< c_~max3~0 (+ .cse417 1)) (< c_~max3~0 (select .cse415 .cse6)) (< .cse418 (+ .cse414 1)) (= c_~max3~0 .cse418))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse422 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse419 (select .cse422 .cse8)) (.cse420 (select .cse422 .cse6)) (.cse421 (select .cse422 .cse5))) (or (< .cse419 .cse420) (< .cse421 (select .cse422 .cse9)) (= .cse419 .cse421) (< c_~max1~0 (select .cse422 .cse11)) (< .cse419 .cse3) (< .cse419 (select .cse422 .cse10)) (< .cse420 .cse18) (< .cse421 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse424 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse426 (select .cse424 .cse10)) (.cse427 (select .cse424 .cse8)) (.cse423 (select .cse424 .cse5)) (.cse425 (select .cse424 .cse6))) (or (< .cse423 (select .cse424 .cse9)) (< .cse425 (+ .cse426 1)) (< c_~max1~0 (select .cse424 .cse11)) (< .cse427 .cse3) (< .cse426 (+ .cse427 1)) (< .cse425 .cse18) (< .cse423 .cse1) (= .cse423 .cse425))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse433 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse431 (select .cse433 .cse9)) (.cse430 (select .cse433 .cse8)) (.cse432 (select .cse433 .cse5)) (.cse428 (select .cse433 .cse11)) (.cse429 (select .cse433 .cse6))) (or (< .cse428 .cse1) (< .cse429 (+ .cse430 1)) (= .cse429 .cse431) (< .cse431 (+ .cse432 1)) (< .cse430 .cse3) (< .cse430 (select .cse433 .cse10)) (< .cse432 (+ .cse428 1)) (< .cse429 .cse18))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse435 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse434 (select .cse435 .cse11)) (.cse436 (select .cse435 .cse8)) (.cse437 (select .cse435 .cse10))) (or (= c_~max3~0 .cse434) (< .cse434 .cse1) (< .cse434 (select .cse435 .cse9)) (< .cse434 (select .cse435 .cse5)) (< .cse436 .cse3) (< .cse437 (+ .cse436 1)) (< c_~max3~0 (+ .cse437 1)) (< c_~max3~0 (select .cse435 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse440 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse439 (select .cse440 .cse10)) (.cse438 (select .cse440 .cse6))) (or (= c_~max1~0 .cse438) (< .cse438 (+ .cse439 1)) (< .cse439 .cse3) (< c_~max1~0 (select .cse440 .cse11)) (< .cse438 .cse18) (< c_~max2~0 (select .cse440 .cse8)) (< c_~max1~0 (select .cse440 .cse5)) (< c_~max1~0 (select .cse440 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse447 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse444 (select .cse447 .cse9)) (.cse445 (select .cse447 .cse5)) (.cse441 (select .cse447 .cse11)) (.cse443 (select .cse447 .cse10)) (.cse446 (select .cse447 .cse8)) (.cse442 (select .cse447 .cse6))) (or (< .cse441 .cse1) (< .cse442 (+ .cse443 1)) (= .cse442 .cse444) (< .cse444 (+ .cse445 1)) (< .cse446 .cse3) (< .cse445 (+ .cse441 1)) (< .cse443 (+ .cse446 1)) (< .cse442 .cse18))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse449 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse448 (select .cse449 .cse5)) (.cse450 (select .cse449 .cse10))) (or (< .cse448 (select .cse449 .cse9)) (< .cse450 .cse3) (< c_~max1~0 (select .cse449 .cse11)) (< c_~max3~0 (select .cse449 .cse6)) (< c_~max2~0 (select .cse449 .cse8)) (< .cse450 c_~max3~0) (< .cse448 .cse1) (= .cse448 .cse450))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse453 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse451 (select .cse453 .cse11)) (.cse454 (select .cse453 .cse8)) (.cse452 (select .cse453 .cse5)) (.cse455 (select .cse453 .cse10))) (or (< .cse451 .cse1) (< .cse452 (select .cse453 .cse9)) (< .cse454 .cse3) (< .cse452 (+ .cse451 1)) (< .cse455 (+ .cse454 1)) (< c_~max3~0 (select .cse453 .cse6)) (< .cse455 c_~max3~0) (= .cse452 .cse455))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse457 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse456 (select .cse457 .cse6))) (or (= c_~max1~0 .cse456) (< c_~max1~0 (select .cse457 .cse11)) (< .cse456 .cse18) (< c_~max2~0 (select .cse457 .cse8)) (< c_~max1~0 (select .cse457 .cse5)) (< .cse456 .cse3) (< c_~max1~0 (select .cse457 .cse9)) (< c_~max2~0 (select .cse457 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse459 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse458 (select .cse459 .cse11)) (.cse460 (select .cse459 .cse8)) (.cse461 (select .cse459 .cse9))) (or (< .cse458 .cse1) (< .cse458 (select .cse459 .cse5)) (< .cse460 .cse3) (< .cse460 (select .cse459 .cse10)) (< c_~max3~0 (select .cse459 .cse6)) (< .cse461 (+ .cse458 1)) (= c_~max3~0 .cse461) (= .cse460 .cse461))))) (or .cse45 (and (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse463 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse462 (select .cse463 .cse10)) (.cse464 (select .cse463 .cse8))) (or (= c_~max1~0 .cse462) (< c_~max1~0 (select .cse463 .cse11)) (< .cse464 .cse3) (< .cse462 (+ .cse464 1)) (< c_~max3~0 (select .cse463 .cse6)) (< c_~max1~0 (select .cse463 .cse5)) (< c_~max1~0 (select .cse463 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse465 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse466 (select .cse465 .cse8)) (.cse467 (select .cse465 .cse10))) (or (< c_~max1~0 (select .cse465 .cse11)) (< .cse466 .cse3) (< .cse467 (+ .cse466 1)) (< c_~max3~0 (+ .cse467 1)) (< c_~max3~0 (select .cse465 .cse6)) (< c_~max1~0 (select .cse465 .cse5)) (< c_~max1~0 (select .cse465 .cse9)))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse470 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse471 (select .cse470 .cse8)) (.cse469 (select .cse470 .cse5)) (.cse468 (select .cse470 .cse9))) (or (< .cse468 (+ .cse469 1)) (< c_~max1~0 (select .cse470 .cse11)) (< .cse471 .cse3) (< .cse471 (select .cse470 .cse10)) (< c_~max3~0 (select .cse470 .cse6)) (< c_~max3~0 (+ .cse471 1)) (< .cse469 .cse1) (= c_~max3~0 .cse468))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse473 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse474 (select .cse473 .cse8)) (.cse472 (select .cse473 .cse11)) (.cse475 (select .cse473 .cse10)) (.cse476 (select .cse473 .cse9))) (or (< .cse472 .cse1) (< .cse472 (select .cse473 .cse5)) (< .cse474 .cse3) (< .cse475 (+ .cse474 1)) (< c_~max3~0 (select .cse473 .cse6)) (< .cse476 (+ .cse472 1)) (= c_~max3~0 .cse476) (= .cse475 .cse476))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse480 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse478 (select .cse480 .cse9)) (.cse479 (select .cse480 .cse5)) (.cse477 (select .cse480 .cse11))) (or (< .cse477 .cse1) (= c_~max2~0 .cse478) (< .cse478 (+ .cse479 1)) (< .cse479 (+ .cse477 1)) (< c_~max3~0 (select .cse480 .cse6)) (< c_~max2~0 (select .cse480 .cse8)) (< c_~max2~0 (select .cse480 .cse10)))))) .cse14) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse484 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse483 (select .cse484 .cse6)) (.cse481 (select .cse484 .cse11)) (.cse482 (select .cse484 .cse10)) (.cse485 (select .cse484 .cse9))) (or (< .cse481 .cse1) (< .cse482 .cse483) (< .cse482 .cse3) (< .cse481 (select .cse484 .cse5)) (< .cse483 .cse18) (< .cse485 (+ .cse481 1)) (< c_~max2~0 (select .cse484 .cse8)) (= .cse482 .cse485))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse487 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse488 (select .cse487 .cse8)) (.cse486 (select .cse487 .cse5))) (or (< .cse486 (select .cse487 .cse9)) (< .cse488 c_~max3~0) (= .cse488 .cse486) (< c_~max1~0 (select .cse487 .cse11)) (< .cse488 .cse3) (< .cse488 (select .cse487 .cse10)) (< c_~max3~0 (select .cse487 .cse6)) (< .cse486 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse492 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse489 (select .cse492 .cse9)) (.cse490 (select .cse492 .cse6)) (.cse491 (select .cse492 .cse5))) (or (= c_~max2~0 .cse489) (= .cse490 .cse489) (< .cse489 (+ .cse491 1)) (< c_~max1~0 (select .cse492 .cse11)) (< .cse490 .cse18) (< c_~max2~0 (select .cse492 .cse8)) (< .cse491 .cse1) (< c_~max2~0 (select .cse492 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse494 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse493 (select .cse494 .cse6)) (.cse495 (select .cse494 .cse8))) (or (= c_~max1~0 .cse493) (< c_~max1~0 (select .cse494 .cse11)) (< .cse495 .cse3) (< .cse495 (select .cse494 .cse10)) (< .cse493 .cse18) (= c_~max1~0 .cse495) (< c_~max1~0 (select .cse494 .cse5)) (< c_~max1~0 (select .cse494 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse497 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse498 (select .cse497 .cse8)) (.cse496 (select .cse497 .cse5))) (or (= .cse496 c_~max3~0) (< .cse496 (select .cse497 .cse9)) (= .cse498 .cse496) (< c_~max1~0 (select .cse497 .cse11)) (< .cse498 .cse3) (< .cse498 (select .cse497 .cse10)) (< c_~max3~0 (select .cse497 .cse6)) (< .cse496 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse501 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse502 (select .cse501 .cse8)) (.cse503 (select .cse501 .cse10)) (.cse500 (select .cse501 .cse5)) (.cse499 (select .cse501 .cse9))) (or (< .cse499 (+ .cse500 1)) (< c_~max1~0 (select .cse501 .cse11)) (< .cse502 .cse3) (< .cse503 (+ .cse502 1)) (< c_~max3~0 (+ .cse503 1)) (< c_~max3~0 (select .cse501 .cse6)) (< .cse500 .cse1) (= c_~max3~0 .cse499))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse510 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse508 (select .cse510 .cse5)) (.cse504 (select .cse510 .cse11)) (.cse509 (select .cse510 .cse8)) (.cse506 (select .cse510 .cse6)) (.cse505 (select .cse510 .cse10)) (.cse507 (select .cse510 .cse9))) (or (< .cse504 .cse1) (< .cse505 .cse506) (< .cse507 (+ .cse508 1)) (< .cse509 .cse3) (< .cse508 (+ .cse504 1)) (< .cse505 (+ .cse509 1)) (< .cse506 .cse18) (= .cse505 .cse507))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse513 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse511 (select .cse513 .cse11)) (.cse512 (select .cse513 .cse10))) (or (< .cse511 .cse1) (< .cse512 .cse3) (< .cse511 (select .cse513 .cse9)) (< .cse511 (select .cse513 .cse5)) (< c_~max3~0 (select .cse513 .cse6)) (= .cse512 .cse511) (< c_~max2~0 (select .cse513 .cse8)) (< .cse512 c_~max3~0))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse515 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse514 (select .cse515 .cse5)) (.cse516 (select .cse515 .cse10))) (or (= .cse514 c_~max3~0) (< .cse514 (select .cse515 .cse9)) (< .cse516 .cse3) (< c_~max1~0 (select .cse515 .cse11)) (< c_~max3~0 (select .cse515 .cse6)) (< c_~max2~0 (select .cse515 .cse8)) (< .cse514 .cse1) (= .cse514 .cse516))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse519 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse518 (select .cse519 .cse10)) (.cse520 (select .cse519 .cse6)) (.cse517 (select .cse519 .cse11))) (or (< .cse517 .cse1) (< .cse518 .cse3) (< .cse517 (select .cse519 .cse9)) (< .cse517 (select .cse519 .cse5)) (< .cse520 .cse18) (= .cse518 .cse517) (< c_~max2~0 (select .cse519 .cse8)) (= .cse520 .cse517))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse523 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse521 (select .cse523 .cse6)) (.cse524 (select .cse523 .cse8)) (.cse522 (select .cse523 .cse9))) (or (= .cse521 .cse522) (< c_~max1~0 (select .cse523 .cse11)) (< .cse524 .cse3) (< .cse524 (select .cse523 .cse10)) (< .cse521 .cse18) (< c_~max1~0 (select .cse523 .cse5)) (< .cse522 .cse1) (= .cse524 .cse522))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse529 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse527 (select .cse529 .cse5)) (.cse525 (select .cse529 .cse11)) (.cse528 (select .cse529 .cse8)) (.cse526 (select .cse529 .cse9))) (or (< .cse525 .cse1) (< .cse526 (+ .cse527 1)) (< .cse528 c_~max3~0) (< .cse528 .cse3) (< .cse528 (select .cse529 .cse10)) (< .cse527 (+ .cse525 1)) (< c_~max3~0 (select .cse529 .cse6)) (= .cse528 .cse526))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse534 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse532 (select .cse534 .cse6)) (.cse530 (select .cse534 .cse11)) (.cse531 (select .cse534 .cse10)) (.cse533 (select .cse534 .cse9))) (or (< .cse530 .cse1) (< .cse531 .cse3) (= .cse532 .cse533) (< .cse530 (select .cse534 .cse5)) (< .cse532 .cse18) (< .cse533 (+ .cse530 1)) (< c_~max2~0 (select .cse534 .cse8)) (= .cse531 .cse533))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse540 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse537 (select .cse540 .cse5)) (.cse535 (select .cse540 .cse11)) (.cse538 (select .cse540 .cse8)) (.cse539 (select .cse540 .cse10)) (.cse536 (select .cse540 .cse9))) (or (< .cse535 .cse1) (< .cse536 (+ .cse537 1)) (< .cse538 .cse3) (< .cse537 (+ .cse535 1)) (< .cse539 (+ .cse538 1)) (< c_~max3~0 (select .cse540 .cse6)) (= c_~max3~0 .cse536) (= .cse539 .cse536))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse541 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse542 (select .cse541 .cse8)) (.cse543 (select .cse541 .cse10)) (.cse544 (select .cse541 .cse9))) (or (< c_~max1~0 (select .cse541 .cse11)) (< .cse542 .cse3) (< .cse543 (+ .cse542 1)) (< c_~max3~0 (select .cse541 .cse6)) (< c_~max1~0 (select .cse541 .cse5)) (< .cse544 .cse1) (= c_~max3~0 .cse544) (= .cse543 .cse544))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse547 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse546 (select .cse547 .cse11)) (.cse548 (select .cse547 .cse8)) (.cse545 (select .cse547 .cse5)) (.cse549 (select .cse547 .cse10))) (or (= .cse545 c_~max3~0) (< .cse546 .cse1) (< .cse545 (select .cse547 .cse9)) (< .cse548 .cse3) (< .cse545 (+ .cse546 1)) (< .cse549 (+ .cse548 1)) (< c_~max3~0 (select .cse547 .cse6)) (= .cse545 .cse549))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse550 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse551 (select .cse550 .cse8)) (.cse552 (select .cse550 .cse10)) (.cse553 (select .cse550 .cse9))) (or (< c_~max1~0 (select .cse550 .cse11)) (< .cse551 .cse3) (< .cse552 (+ .cse551 1)) (< c_~max3~0 (select .cse550 .cse6)) (< .cse552 c_~max3~0) (< c_~max1~0 (select .cse550 .cse5)) (< .cse553 .cse1) (= .cse552 .cse553))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse556 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse558 (select .cse556 .cse8)) (.cse554 (select .cse556 .cse11)) (.cse555 (select .cse556 .cse5)) (.cse557 (select .cse556 .cse6))) (or (< .cse554 .cse1) (< .cse555 (select .cse556 .cse9)) (< .cse557 (+ .cse558 1)) (< .cse558 .cse3) (< .cse558 (select .cse556 .cse10)) (< .cse555 (+ .cse554 1)) (< .cse557 .cse18) (= .cse555 .cse557))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse562 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse561 (select .cse562 .cse5)) (.cse560 (select .cse562 .cse11)) (.cse559 (select .cse562 .cse6))) (or (< c_~max2~0 .cse559) (< .cse560 .cse1) (< .cse561 (select .cse562 .cse9)) (= .cse561 c_~max2~0) (< .cse561 (+ .cse560 1)) (< .cse559 .cse18) (< c_~max2~0 (select .cse562 .cse8)) (< c_~max2~0 (select .cse562 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse565 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse564 (select .cse565 .cse11)) (.cse563 (select .cse565 .cse5)) (.cse566 (select .cse565 .cse10))) (or (= .cse563 c_~max3~0) (< .cse564 .cse1) (< .cse563 (select .cse565 .cse9)) (< .cse566 .cse3) (< .cse563 (+ .cse564 1)) (< c_~max3~0 (select .cse565 .cse6)) (< c_~max2~0 (select .cse565 .cse8)) (= .cse563 .cse566))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse569 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse567 (select .cse569 .cse11)) (.cse568 (select .cse569 .cse8))) (or (= c_~max3~0 .cse567) (= .cse568 .cse567) (< .cse567 .cse1) (< .cse567 (select .cse569 .cse9)) (< .cse567 (select .cse569 .cse5)) (< .cse568 .cse3) (< .cse568 (select .cse569 .cse10)) (< c_~max3~0 (select .cse569 .cse6)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse573 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse570 (select .cse573 .cse6)) (.cse572 (select .cse573 .cse5)) (.cse574 (select .cse573 .cse8)) (.cse571 (select .cse573 .cse9))) (or (= .cse570 .cse571) (< .cse571 (+ .cse572 1)) (< c_~max1~0 (select .cse573 .cse11)) (< .cse574 .cse3) (< .cse574 (select .cse573 .cse10)) (< .cse570 .cse18) (< .cse572 .cse1) (= .cse574 .cse571))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse577 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse575 (select .cse577 .cse11)) (.cse579 (select .cse577 .cse6)) (.cse576 (select .cse577 .cse5)) (.cse578 (select .cse577 .cse10))) (or (< .cse575 .cse1) (< .cse576 (select .cse577 .cse9)) (< .cse578 .cse579) (< .cse578 .cse3) (< .cse576 (+ .cse575 1)) (< .cse579 .cse18) (< c_~max2~0 (select .cse577 .cse8)) (= .cse576 .cse578))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse582 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse580 (select .cse582 .cse11)) (.cse581 (select .cse582 .cse5)) (.cse583 (select .cse582 .cse10))) (or (< .cse580 .cse1) (< .cse581 (select .cse582 .cse9)) (< .cse583 .cse3) (< .cse581 (+ .cse580 1)) (< c_~max3~0 (select .cse582 .cse6)) (< c_~max2~0 (select .cse582 .cse8)) (< .cse583 c_~max3~0) (= .cse581 .cse583))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse587 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse586 (select .cse587 .cse8)) (.cse585 (select .cse587 .cse6)) (.cse584 (select .cse587 .cse11))) (or (< .cse584 .cse1) (< .cse585 (+ .cse586 1)) (< .cse584 (select .cse587 .cse9)) (< .cse584 (select .cse587 .cse5)) (< .cse586 .cse3) (< .cse586 (select .cse587 .cse10)) (< .cse585 .cse18) (= .cse585 .cse584))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse592 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse589 (select .cse592 .cse6)) (.cse591 (select .cse592 .cse5)) (.cse588 (select .cse592 .cse8)) (.cse590 (select .cse592 .cse9))) (or (< .cse588 .cse589) (< .cse590 (+ .cse591 1)) (< c_~max1~0 (select .cse592 .cse11)) (< .cse588 .cse3) (< .cse588 (select .cse592 .cse10)) (< .cse589 .cse18) (< .cse591 .cse1) (= .cse588 .cse590))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse597 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse595 (select .cse597 .cse10)) (.cse598 (select .cse597 .cse8)) (.cse594 (select .cse597 .cse6)) (.cse596 (select .cse597 .cse9)) (.cse593 (select .cse597 .cse11))) (or (< .cse593 .cse1) (< .cse594 (+ .cse595 1)) (= .cse594 .cse596) (< .cse593 (select .cse597 .cse5)) (< .cse598 .cse3) (< .cse595 (+ .cse598 1)) (< .cse594 .cse18) (< .cse596 (+ .cse593 1)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse602 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse600 (select .cse602 .cse8)) (.cse599 (select .cse602 .cse6)) (.cse601 (select .cse602 .cse9))) (or (< .cse599 (+ .cse600 1)) (= .cse599 .cse601) (< c_~max1~0 (select .cse602 .cse11)) (< .cse600 .cse3) (< .cse600 (select .cse602 .cse10)) (< .cse599 .cse18) (< c_~max1~0 (select .cse602 .cse5)) (< .cse601 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse606 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse604 (select .cse606 .cse9)) (.cse603 (select .cse606 .cse6)) (.cse605 (select .cse606 .cse5))) (or (< c_~max2~0 .cse603) (= c_~max2~0 .cse604) (< .cse604 (+ .cse605 1)) (< c_~max1~0 (select .cse606 .cse11)) (< .cse603 .cse18) (< c_~max2~0 (select .cse606 .cse8)) (< .cse605 .cse1) (< c_~max2~0 (select .cse606 .cse10)))))) (or (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse609 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse608 (select .cse609 .cse5)) (.cse607 (select .cse609 .cse9))) (or (< .cse607 (+ .cse608 1)) (< c_~max1~0 (select .cse609 .cse11)) (< c_~max3~0 (select .cse609 .cse6)) (< c_~max2~0 (select .cse609 .cse8)) (< .cse608 .cse1) (= c_~max3~0 .cse607) (< c_~max2~0 (select .cse609 .cse10)))))) .cse50) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse612 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse610 (select .cse612 .cse8)) (.cse613 (select .cse612 .cse6)) (.cse611 (select .cse612 .cse11))) (or (= .cse610 .cse611) (< .cse611 .cse1) (< .cse611 (select .cse612 .cse9)) (< .cse611 (select .cse612 .cse5)) (< .cse610 .cse3) (< .cse610 (select .cse612 .cse10)) (< .cse613 .cse18) (= .cse613 .cse611))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse615 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse614 (select .cse615 .cse11)) (.cse616 (select .cse615 .cse6))) (or (< .cse614 .cse1) (< .cse614 (select .cse615 .cse9)) (< .cse614 (select .cse615 .cse5)) (< .cse616 .cse18) (< c_~max2~0 (select .cse615 .cse8)) (= .cse616 .cse614) (< .cse616 .cse3) (< c_~max2~0 (select .cse615 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse619 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse617 (select .cse619 .cse11)) (.cse618 (select .cse619 .cse9))) (or (< .cse617 .cse1) (= c_~max2~0 .cse618) (< .cse617 (select .cse619 .cse5)) (< c_~max3~0 (select .cse619 .cse6)) (< .cse618 (+ .cse617 1)) (< c_~max2~0 (select .cse619 .cse8)) (= c_~max3~0 .cse618) (< c_~max2~0 (select .cse619 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse623 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse622 (select .cse623 .cse6)) (.cse621 (select .cse623 .cse9)) (.cse620 (select .cse623 .cse11))) (or (< .cse620 .cse1) (= c_~max2~0 .cse621) (= .cse622 .cse621) (< .cse620 (select .cse623 .cse5)) (< .cse622 .cse18) (< .cse621 (+ .cse620 1)) (< c_~max2~0 (select .cse623 .cse8)) (< c_~max2~0 (select .cse623 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse625 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse624 (select .cse625 .cse10))) (or (= c_~max1~0 .cse624) (< .cse624 .cse3) (< c_~max1~0 (select .cse625 .cse11)) (< c_~max3~0 (select .cse625 .cse6)) (< c_~max2~0 (select .cse625 .cse8)) (< .cse624 c_~max3~0) (< c_~max1~0 (select .cse625 .cse5)) (< c_~max1~0 (select .cse625 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse628 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse627 (select .cse628 .cse5)) (.cse629 (select .cse628 .cse8)) (.cse626 (select .cse628 .cse9))) (or (< .cse626 (+ .cse627 1)) (< c_~max1~0 (select .cse628 .cse11)) (< .cse629 .cse3) (< .cse629 (select .cse628 .cse10)) (< c_~max3~0 (select .cse628 .cse6)) (< .cse627 .cse1) (= c_~max3~0 .cse626) (= .cse629 .cse626))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse631 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse630 (select .cse631 .cse10)) (.cse632 (select .cse631 .cse9))) (or (< .cse630 .cse3) (< c_~max1~0 (select .cse631 .cse11)) (< c_~max3~0 (+ .cse630 1)) (< c_~max3~0 (select .cse631 .cse6)) (< c_~max2~0 (select .cse631 .cse8)) (< c_~max1~0 (select .cse631 .cse5)) (< .cse632 .cse1) (= c_~max3~0 .cse632))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse637 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse635 (select .cse637 .cse9)) (.cse636 (select .cse637 .cse5)) (.cse633 (select .cse637 .cse11)) (.cse634 (select .cse637 .cse6))) (or (< .cse633 .cse1) (= .cse634 .cse635) (< .cse635 (+ .cse636 1)) (< .cse636 (+ .cse633 1)) (< .cse634 .cse18) (< c_~max2~0 (select .cse637 .cse8)) (< .cse634 .cse3) (< c_~max2~0 (select .cse637 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse641 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse642 (select .cse641 .cse8)) (.cse638 (select .cse641 .cse6)) (.cse640 (select .cse641 .cse5)) (.cse643 (select .cse641 .cse10)) (.cse639 (select .cse641 .cse9))) (or (= .cse638 .cse639) (< .cse639 (+ .cse640 1)) (< c_~max1~0 (select .cse641 .cse11)) (< .cse642 .cse3) (< .cse643 (+ .cse642 1)) (< .cse638 .cse18) (< .cse640 .cse1) (= .cse643 .cse639))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse647 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse645 (select .cse647 .cse11)) (.cse644 (select .cse647 .cse8)) (.cse646 (select .cse647 .cse6))) (or (= .cse644 .cse645) (< .cse645 .cse1) (< .cse644 .cse646) (< .cse645 (select .cse647 .cse9)) (< .cse645 (select .cse647 .cse5)) (< .cse644 .cse3) (< .cse644 (select .cse647 .cse10)) (< .cse646 .cse18))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse653 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse652 (select .cse653 .cse5)) (.cse648 (select .cse653 .cse11)) (.cse650 (select .cse653 .cse6)) (.cse649 (select .cse653 .cse10)) (.cse651 (select .cse653 .cse9))) (or (< .cse648 .cse1) (< .cse649 .cse650) (< .cse649 .cse3) (< .cse651 (+ .cse652 1)) (< .cse652 (+ .cse648 1)) (< .cse650 .cse18) (< c_~max2~0 (select .cse653 .cse8)) (= .cse649 .cse651))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse656 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse654 (select .cse656 .cse5)) (.cse655 (select .cse656 .cse11)) (.cse657 (select .cse656 .cse10))) (or (= .cse654 c_~max3~0) (< .cse655 .cse1) (< .cse654 (select .cse656 .cse9)) (< .cse657 .cse3) (< .cse654 (+ .cse655 1)) (< c_~max3~0 (+ .cse657 1)) (< c_~max3~0 (select .cse656 .cse6)) (< c_~max2~0 (select .cse656 .cse8)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse661 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse662 (select .cse661 .cse8)) (.cse659 (select .cse661 .cse6)) (.cse658 (select .cse661 .cse11)) (.cse663 (select .cse661 .cse10)) (.cse660 (select .cse661 .cse9))) (or (< .cse658 .cse1) (= .cse659 .cse660) (< .cse658 (select .cse661 .cse5)) (< .cse662 .cse3) (< .cse663 (+ .cse662 1)) (< .cse659 .cse18) (< .cse660 (+ .cse658 1)) (= .cse663 .cse660))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse665 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse666 (select .cse665 .cse8)) (.cse664 (select .cse665 .cse11)) (.cse667 (select .cse665 .cse10)) (.cse668 (select .cse665 .cse9))) (or (< .cse664 .cse1) (< .cse664 (select .cse665 .cse5)) (< .cse666 .cse3) (< .cse667 (+ .cse666 1)) (< c_~max3~0 (select .cse665 .cse6)) (< .cse668 (+ .cse664 1)) (< .cse667 c_~max3~0) (= .cse667 .cse668))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse674 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse672 (select .cse674 .cse5)) (.cse669 (select .cse674 .cse11)) (.cse670 (select .cse674 .cse6)) (.cse673 (select .cse674 .cse8)) (.cse671 (select .cse674 .cse9))) (or (< .cse669 .cse1) (= .cse670 .cse671) (< .cse671 (+ .cse672 1)) (< .cse673 .cse3) (< .cse673 (select .cse674 .cse10)) (< .cse672 (+ .cse669 1)) (< .cse670 .cse18) (= .cse673 .cse671))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse677 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse675 (select .cse677 .cse10)) (.cse676 (select .cse677 .cse6))) (or (= c_~max1~0 .cse675) (= c_~max1~0 .cse676) (< .cse675 .cse3) (< c_~max1~0 (select .cse677 .cse11)) (< .cse676 .cse18) (< c_~max2~0 (select .cse677 .cse8)) (< c_~max1~0 (select .cse677 .cse5)) (< c_~max1~0 (select .cse677 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse679 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse678 (select .cse679 .cse11)) (.cse680 (select .cse679 .cse8)) (.cse681 (select .cse679 .cse9))) (or (< .cse678 .cse1) (< .cse678 (select .cse679 .cse5)) (< .cse680 c_~max3~0) (< .cse680 .cse3) (< .cse680 (select .cse679 .cse10)) (< c_~max3~0 (select .cse679 .cse6)) (< .cse681 (+ .cse678 1)) (= .cse680 .cse681))))) (or .cse45 (and (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse683 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse682 (select .cse683 .cse10))) (or (= c_~max1~0 .cse682) (< .cse682 .cse3) (< c_~max1~0 (select .cse683 .cse11)) (< c_~max3~0 (select .cse683 .cse6)) (< c_~max2~0 (select .cse683 .cse8)) (< c_~max1~0 (select .cse683 .cse5)) (< c_~max1~0 (select .cse683 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse685 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse684 (select .cse685 .cse10))) (or (< .cse684 .cse3) (< c_~max1~0 (select .cse685 .cse11)) (< c_~max3~0 (+ .cse684 1)) (< c_~max3~0 (select .cse685 .cse6)) (< c_~max2~0 (select .cse685 .cse8)) (< c_~max1~0 (select .cse685 .cse5)) (< c_~max1~0 (select .cse685 .cse9)))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse687 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse688 (select .cse687 .cse8)) (.cse686 (select .cse687 .cse5))) (or (= .cse686 c_~max3~0) (< .cse686 (select .cse687 .cse9)) (< c_~max1~0 (select .cse687 .cse11)) (< .cse688 .cse3) (< .cse688 (select .cse687 .cse10)) (< c_~max3~0 (select .cse687 .cse6)) (< c_~max3~0 (+ .cse688 1)) (< .cse686 .cse1))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse691 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse689 (select .cse691 .cse11)) (.cse690 (select .cse691 .cse10)) (.cse692 (select .cse691 .cse9))) (or (< .cse689 .cse1) (< .cse690 .cse3) (< .cse689 (select .cse691 .cse5)) (< c_~max3~0 (select .cse691 .cse6)) (< .cse692 (+ .cse689 1)) (< c_~max2~0 (select .cse691 .cse8)) (= c_~max3~0 .cse692) (= .cse690 .cse692))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse695 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse696 (select .cse695 .cse8)) (.cse694 (select .cse695 .cse5)) (.cse697 (select .cse695 .cse10)) (.cse693 (select .cse695 .cse9))) (or (< .cse693 (+ .cse694 1)) (< c_~max1~0 (select .cse695 .cse11)) (< .cse696 .cse3) (< .cse697 (+ .cse696 1)) (< c_~max3~0 (select .cse695 .cse6)) (< .cse697 c_~max3~0) (< .cse694 .cse1) (= .cse697 .cse693))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse700 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse699 (select .cse700 .cse10)) (.cse698 (select .cse700 .cse11)) (.cse701 (select .cse700 .cse9))) (or (< .cse698 .cse1) (< .cse699 .cse3) (< .cse698 (select .cse700 .cse5)) (< c_~max3~0 (+ .cse699 1)) (< c_~max3~0 (select .cse700 .cse6)) (< .cse701 (+ .cse698 1)) (< c_~max2~0 (select .cse700 .cse8)) (= c_~max3~0 .cse701))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse702 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse703 (select .cse702 .cse8)) (.cse704 (select .cse702 .cse9))) (or (< c_~max1~0 (select .cse702 .cse11)) (< .cse703 .cse3) (< .cse703 (select .cse702 .cse10)) (< c_~max3~0 (select .cse702 .cse6)) (< c_~max3~0 (+ .cse703 1)) (< c_~max1~0 (select .cse702 .cse5)) (< .cse704 .cse1) (= c_~max3~0 .cse704))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse709 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse707 (select .cse709 .cse8)) (.cse706 (select .cse709 .cse6)) (.cse708 (select .cse709 .cse9)) (.cse705 (select .cse709 .cse11))) (or (< .cse705 .cse1) (< .cse706 (+ .cse707 1)) (= .cse706 .cse708) (< .cse705 (select .cse709 .cse5)) (< .cse707 .cse3) (< .cse707 (select .cse709 .cse10)) (< .cse706 .cse18) (< .cse708 (+ .cse705 1)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse711 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse714 (select .cse711 .cse8)) (.cse713 (select .cse711 .cse6)) (.cse710 (select .cse711 .cse5)) (.cse712 (select .cse711 .cse10))) (or (< .cse710 (select .cse711 .cse9)) (< .cse712 .cse713) (< c_~max1~0 (select .cse711 .cse11)) (< .cse714 .cse3) (< .cse712 (+ .cse714 1)) (< .cse713 .cse18) (< .cse710 .cse1) (= .cse710 .cse712))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse716 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse717 (select .cse716 .cse8)) (.cse715 (select .cse716 .cse5)) (.cse718 (select .cse716 .cse6))) (or (< .cse715 (select .cse716 .cse9)) (= .cse717 .cse715) (< c_~max1~0 (select .cse716 .cse11)) (< .cse717 .cse3) (< .cse717 (select .cse716 .cse10)) (< .cse718 .cse18) (< .cse715 .cse1) (= .cse715 .cse718))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse722 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse721 (select .cse722 .cse9)) (.cse719 (select .cse722 .cse11)) (.cse720 (select .cse722 .cse6))) (or (< .cse719 .cse1) (= .cse720 .cse721) (< .cse719 (select .cse722 .cse5)) (< .cse720 .cse18) (< .cse721 (+ .cse719 1)) (< c_~max2~0 (select .cse722 .cse8)) (< .cse720 .cse3) (< c_~max2~0 (select .cse722 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse727 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse725 (select .cse727 .cse5)) (.cse723 (select .cse727 .cse11)) (.cse726 (select .cse727 .cse8)) (.cse724 (select .cse727 .cse9))) (or (< .cse723 .cse1) (< .cse724 (+ .cse725 1)) (< .cse726 .cse3) (< .cse726 (select .cse727 .cse10)) (< .cse725 (+ .cse723 1)) (< c_~max3~0 (select .cse727 .cse6)) (< c_~max3~0 (+ .cse726 1)) (= c_~max3~0 .cse724))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse731 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse730 (select .cse731 .cse6)) (.cse728 (select .cse731 .cse11)) (.cse729 (select .cse731 .cse8)) (.cse732 (select .cse731 .cse9))) (or (< .cse728 .cse1) (< .cse729 .cse730) (< .cse728 (select .cse731 .cse5)) (< .cse729 .cse3) (< .cse729 (select .cse731 .cse10)) (< .cse730 .cse18) (< .cse732 (+ .cse728 1)) (= .cse729 .cse732))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse737 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse734 (select .cse737 .cse6)) (.cse736 (select .cse737 .cse5)) (.cse733 (select .cse737 .cse10)) (.cse735 (select .cse737 .cse9))) (or (< .cse733 .cse734) (< .cse733 .cse3) (< .cse735 (+ .cse736 1)) (< c_~max1~0 (select .cse737 .cse11)) (< .cse734 .cse18) (< c_~max2~0 (select .cse737 .cse8)) (< .cse736 .cse1) (= .cse733 .cse735))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse738 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse739 (select .cse738 .cse8)) (.cse740 (select .cse738 .cse10)) (.cse741 (select .cse738 .cse9))) (or (< c_~max1~0 (select .cse738 .cse11)) (< .cse739 .cse3) (< .cse740 (+ .cse739 1)) (< c_~max3~0 (+ .cse740 1)) (< c_~max3~0 (select .cse738 .cse6)) (< c_~max1~0 (select .cse738 .cse5)) (< .cse741 .cse1) (= c_~max3~0 .cse741))))) (or .cse45 (and (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse742 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse743 (select .cse742 .cse8))) (or (< c_~max1~0 (select .cse742 .cse11)) (< .cse743 .cse3) (< .cse743 (select .cse742 .cse10)) (< c_~max3~0 (select .cse742 .cse6)) (< c_~max3~0 (+ .cse743 1)) (< c_~max1~0 (select .cse742 .cse5)) (< c_~max1~0 (select .cse742 .cse9)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse744 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse745 (select .cse744 .cse8))) (or (< c_~max1~0 (select .cse744 .cse11)) (< .cse745 .cse3) (< .cse745 (select .cse744 .cse10)) (< c_~max3~0 (select .cse744 .cse6)) (= c_~max1~0 .cse745) (< c_~max1~0 (select .cse744 .cse5)) (< c_~max1~0 (select .cse744 .cse9)))))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse747 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse746 (select .cse747 .cse10)) (.cse748 (select .cse747 .cse9))) (or (< .cse746 .cse3) (< c_~max1~0 (select .cse747 .cse11)) (< c_~max3~0 (select .cse747 .cse6)) (< c_~max2~0 (select .cse747 .cse8)) (< .cse746 c_~max3~0) (< c_~max1~0 (select .cse747 .cse5)) (< .cse748 .cse1) (= .cse746 .cse748))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse753 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse752 (select .cse753 .cse5)) (.cse749 (select .cse753 .cse11)) (.cse750 (select .cse753 .cse10)) (.cse751 (select .cse753 .cse9))) (or (< .cse749 .cse1) (< .cse750 .cse3) (< .cse751 (+ .cse752 1)) (< .cse752 (+ .cse749 1)) (< c_~max3~0 (select .cse753 .cse6)) (< c_~max2~0 (select .cse753 .cse8)) (= c_~max3~0 .cse751) (= .cse750 .cse751))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse754 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse755 (select .cse754 .cse8)) (.cse756 (select .cse754 .cse9))) (or (< c_~max1~0 (select .cse754 .cse11)) (< .cse755 .cse3) (< .cse755 (select .cse754 .cse10)) (< c_~max3~0 (select .cse754 .cse6)) (< c_~max1~0 (select .cse754 .cse5)) (< .cse756 .cse1) (= c_~max3~0 .cse756) (= .cse755 .cse756))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse760 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse759 (select .cse760 .cse10)) (.cse761 (select .cse760 .cse8)) (.cse758 (select .cse760 .cse6)) (.cse757 (select .cse760 .cse11))) (or (< .cse757 .cse1) (< .cse758 (+ .cse759 1)) (< .cse757 (select .cse760 .cse9)) (< .cse757 (select .cse760 .cse5)) (< .cse761 .cse3) (< .cse759 (+ .cse761 1)) (< .cse758 .cse18) (= .cse758 .cse757))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse765 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse763 (select .cse765 .cse6)) (.cse762 (select .cse765 .cse11)) (.cse766 (select .cse765 .cse8)) (.cse764 (select .cse765 .cse9))) (or (< .cse762 .cse1) (= .cse763 .cse764) (< .cse762 (select .cse765 .cse5)) (< .cse766 .cse3) (< .cse766 (select .cse765 .cse10)) (< .cse763 .cse18) (< .cse764 (+ .cse762 1)) (= .cse766 .cse764))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse770 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse769 (select .cse770 .cse10)) (.cse768 (select .cse770 .cse6)) (.cse767 (select .cse770 .cse11))) (or (< .cse767 .cse1) (< .cse768 (+ .cse769 1)) (< .cse769 .cse3) (< .cse767 (select .cse770 .cse9)) (< .cse767 (select .cse770 .cse5)) (< .cse768 .cse18) (< c_~max2~0 (select .cse770 .cse8)) (= .cse768 .cse767))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse773 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse771 (select .cse773 .cse11)) (.cse772 (select .cse773 .cse5)) (.cse774 (select .cse773 .cse6))) (or (< .cse771 .cse1) (< .cse772 (select .cse773 .cse9)) (= .cse772 c_~max2~0) (< .cse772 (+ .cse771 1)) (< .cse774 .cse18) (< c_~max2~0 (select .cse773 .cse8)) (= .cse772 .cse774) (< c_~max2~0 (select .cse773 .cse10)))))) (forall ((v_ArrVal_145 (Array Int Int))) (let ((.cse778 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base))) (let ((.cse777 (select .cse778 .cse6)) (.cse776 (select .cse778 .cse10)) (.cse775 (select .cse778 .cse11))) (or (< .cse775 .cse1) (< .cse776 .cse777) (< .cse776 .cse3) (< .cse775 (select .cse778 .cse9)) (< .cse775 (select .cse778 .cse5)) (< .cse777 .cse18) (= .cse776 .cse775) (< c_~max2~0 (select .cse778 .cse8))))))))) (< c_~M~0 (+ c_thread2Thread1of1ForFork0_~i~1 2))) is different from true [2023-12-02 20:51:09,329 WARN L293 SmtUtils]: Spent 11.86s on a formula simplification that was a NOOP. DAG size: 498 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:52:14,868 WARN L293 SmtUtils]: Spent 14.31s on a formula simplification that was a NOOP. DAG size: 501 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:52:46,550 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 349 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:53:23,961 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 568 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:53:27,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:27,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 158 [2023-12-02 20:53:27,580 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-02 20:53:27,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1988 treesize of output 1899 [2023-12-02 20:53:27,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:27,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:27,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:27,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 422 [2023-12-02 20:53:27,705 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 20:53:27,706 INFO L378 Elim1Store]: Elim1 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 896 treesize of output 776 [2023-12-02 20:53:27,771 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 20:53:27,772 INFO L378 Elim1Store]: Elim1 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 415 treesize of output 355 [2023-12-02 20:53:28,401 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2023-12-02 20:53:28,417 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:28,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 1 [2023-12-02 20:53:28,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:28,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 135 [2023-12-02 20:53:28,497 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:28,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3042 treesize of output 2886 [2023-12-02 20:53:28,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:28,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:28,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 286 [2023-12-02 20:53:28,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:28,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:28,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 260 [2023-12-02 20:53:28,723 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:28,724 INFO L378 Elim1Store]: Elim1 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 359 treesize of output 259 [2023-12-02 20:53:29,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:29,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 153 [2023-12-02 20:53:29,687 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:29,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14527 treesize of output 13795 [2023-12-02 20:53:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:29,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 367 [2023-12-02 20:53:29,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:29,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:29,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 307 [2023-12-02 20:53:30,178 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:30,178 INFO L378 Elim1Store]: Elim1 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 421 treesize of output 305 [2023-12-02 20:53:30,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:30,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 120 [2023-12-02 20:53:30,517 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:30,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 686 treesize of output 654 [2023-12-02 20:53:30,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:30,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:30,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 335 [2023-12-02 20:53:30,659 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:30,660 INFO L378 Elim1Store]: Elim1 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 674 treesize of output 582 [2023-12-02 20:53:30,737 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:30,738 INFO L378 Elim1Store]: Elim1 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 578 treesize of output 534 [2023-12-02 20:53:31,490 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:31,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 1 [2023-12-02 20:53:31,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:31,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 141 [2023-12-02 20:53:31,584 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:31,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1888 treesize of output 1808 [2023-12-02 20:53:31,719 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:31,719 INFO L378 Elim1Store]: Elim1 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 928 treesize of output 876 [2023-12-02 20:53:31,818 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:31,819 INFO L378 Elim1Store]: Elim1 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 872 treesize of output 764 [2023-12-02 20:53:31,961 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:31,962 INFO L378 Elim1Store]: Elim1 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 391 treesize of output 367 [2023-12-02 20:53:32,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:32,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 139 [2023-12-02 20:53:32,909 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:32,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 890 treesize of output 854 [2023-12-02 20:53:33,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:33,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 441 [2023-12-02 20:53:33,079 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:33,080 INFO L378 Elim1Store]: Elim1 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 888 treesize of output 788 [2023-12-02 20:53:33,173 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:33,174 INFO L378 Elim1Store]: Elim1 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 784 treesize of output 736 [2023-12-02 20:53:34,170 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2023-12-02 20:53:34,190 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 1 [2023-12-02 20:53:34,210 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2023-12-02 20:53:34,229 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 1 [2023-12-02 20:53:34,249 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2023-12-02 20:53:34,268 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:34,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 1 [2023-12-02 20:53:34,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 175 [2023-12-02 20:53:34,363 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:34,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2088 treesize of output 1992 [2023-12-02 20:53:34,497 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:34,498 INFO L378 Elim1Store]: Elim1 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 892 treesize of output 768 [2023-12-02 20:53:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:34,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 338 [2023-12-02 20:53:34,634 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:34,634 INFO L378 Elim1Store]: Elim1 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 395 treesize of output 335 [2023-12-02 20:53:36,475 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 1 [2023-12-02 20:53:36,494 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2023-12-02 20:53:36,513 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 1 [2023-12-02 20:53:36,533 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:36,554 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:36,575 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:36,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:36,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:36,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 123 [2023-12-02 20:53:36,673 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:36,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3311 treesize of output 3171 [2023-12-02 20:53:36,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:36,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 339 [2023-12-02 20:53:36,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:36,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:36,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 315 [2023-12-02 20:53:37,189 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:37,190 INFO L378 Elim1Store]: Elim1 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 405 treesize of output 313 [2023-12-02 20:53:37,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:37,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 125 [2023-12-02 20:53:37,537 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:37,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6815 treesize of output 6531 [2023-12-02 20:53:37,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:37,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:37,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 363 [2023-12-02 20:53:37,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:37,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:53:37,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 322 [2023-12-02 20:53:37,774 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:37,775 INFO L378 Elim1Store]: Elim1 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 452 treesize of output 360 [2023-12-02 20:53:38,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:38,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 155 [2023-12-02 20:53:38,701 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:38,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1791 treesize of output 1707 [2023-12-02 20:53:38,828 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:38,828 INFO L378 Elim1Store]: Elim1 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 787 treesize of output 735 [2023-12-02 20:53:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:38,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 349 [2023-12-02 20:53:38,962 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:38,963 INFO L378 Elim1Store]: Elim1 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 703 treesize of output 595 [2023-12-02 20:53:40,010 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 1 [2023-12-02 20:53:40,030 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2023-12-02 20:53:40,052 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:40,073 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 1 [2023-12-02 20:53:40,096 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 1 [2023-12-02 20:53:40,118 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2023-12-02 20:53:40,139 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2023-12-02 20:53:40,161 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 1 [2023-12-02 20:53:40,182 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:40,204 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 1 [2023-12-02 20:53:40,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 20:53:40,255 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:40,281 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:40,327 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 1 [2023-12-02 20:53:40,352 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:40,375 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:40,401 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:40,428 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 1 [2023-12-02 20:53:40,454 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 1 [2023-12-02 20:53:40,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 1 [2023-12-02 20:53:40,502 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2023-12-02 20:53:40,526 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 1 [2023-12-02 20:53:40,549 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 1 [2023-12-02 20:53:40,574 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:40,598 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:40,622 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2023-12-02 20:53:40,648 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 1 [2023-12-02 20:53:40,674 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 1 [2023-12-02 20:53:40,698 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 1 [2023-12-02 20:53:40,723 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:40,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 1 [2023-12-02 20:53:40,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:40,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-12-02 20:53:40,822 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:40,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1631 treesize of output 1555 [2023-12-02 20:53:40,950 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:40,950 INFO L378 Elim1Store]: Elim1 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 791 treesize of output 747 [2023-12-02 20:53:41,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:41,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 357 [2023-12-02 20:53:41,089 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:41,090 INFO L378 Elim1Store]: Elim1 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 719 treesize of output 627 [2023-12-02 20:53:42,337 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2023-12-02 20:53:42,360 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:42,384 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2023-12-02 20:53:42,407 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 1 [2023-12-02 20:53:42,430 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 1 [2023-12-02 20:53:42,454 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:42,478 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 1 [2023-12-02 20:53:42,503 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:42,528 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-12-02 20:53:42,554 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 1 [2023-12-02 20:53:42,578 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:42,602 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 1 [2023-12-02 20:53:42,627 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-12-02 20:53:42,662 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 1 [2023-12-02 20:53:42,685 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:42,708 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 1 [2023-12-02 20:53:42,732 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-12-02 20:53:42,758 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 1 [2023-12-02 20:53:42,783 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:42,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2023-12-02 20:53:42,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:42,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 139 [2023-12-02 20:53:42,883 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:42,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1856 treesize of output 1780 [2023-12-02 20:53:43,029 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:43,029 INFO L378 Elim1Store]: Elim1 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 914 treesize of output 814 [2023-12-02 20:53:43,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:43,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 370 [2023-12-02 20:53:43,206 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:43,206 INFO L378 Elim1Store]: Elim1 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 415 treesize of output 367 [2023-12-02 20:53:44,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:44,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 141 [2023-12-02 20:53:44,267 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:44,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1888 treesize of output 1808 [2023-12-02 20:53:44,403 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:44,404 INFO L378 Elim1Store]: Elim1 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 944 treesize of output 836 [2023-12-02 20:53:44,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:44,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 378 [2023-12-02 20:53:44,565 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:44,566 INFO L378 Elim1Store]: Elim1 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 427 treesize of output 375 [2023-12-02 20:53:45,422 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 1 [2023-12-02 20:53:45,448 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 1 [2023-12-02 20:53:45,472 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-12-02 20:53:45,497 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 1 [2023-12-02 20:53:45,523 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:45,549 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2023-12-02 20:53:45,574 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 1 [2023-12-02 20:53:45,596 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:45,620 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 1 [2023-12-02 20:53:45,643 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:45,666 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 1 [2023-12-02 20:53:45,689 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2023-12-02 20:53:45,712 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 1 [2023-12-02 20:53:45,735 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-12-02 20:53:45,759 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 1 [2023-12-02 20:53:45,784 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2023-12-02 20:53:45,808 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:45,831 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 1 [2023-12-02 20:53:45,854 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 1 [2023-12-02 20:53:45,876 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-12-02 20:53:45,899 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-12-02 20:53:45,921 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 1 [2023-12-02 20:53:45,945 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:45,979 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:45,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 1 [2023-12-02 20:53:46,005 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 1 [2023-12-02 20:53:46,029 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 20:53:46,053 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 1 [2023-12-02 20:53:46,081 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 20:53:46,109 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 1 [2023-12-02 20:53:46,152 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 1 [2023-12-02 20:53:46,176 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 1 [2023-12-02 20:53:46,201 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:46,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2023-12-02 20:53:46,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:53:46,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 119 [2023-12-02 20:53:46,331 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:46,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6431 treesize of output 6163 [2023-12-02 20:53:46,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:53:46,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 375 [2023-12-02 20:53:46,539 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:46,539 INFO L378 Elim1Store]: Elim1 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 787 treesize of output 703 [2023-12-02 20:53:46,644 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 20:53:46,644 INFO L378 Elim1Store]: Elim1 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 369 treesize of output 329 [2023-12-02 20:53:47,173 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 1 [2023-12-02 20:53:47,198 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 1 [2023-12-02 20:53:47,222 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2023-12-02 20:53:47,247 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2023-12-02 20:53:47,273 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 20:53:47,299 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 1 [2023-12-02 20:53:47,325 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-12-02 20:53:47,349 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 1 [2023-12-02 20:53:47,384 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 1 [2023-12-02 20:53:47,409 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 1 [2023-12-02 20:53:47,431 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:47,456 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:53:47,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-12-02 20:53:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:53:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711582923] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:53:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:53:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 61 [2023-12-02 20:53:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030840985] [2023-12-02 20:53:56,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:53:56,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-02 20:53:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:53:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-02 20:53:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3357, Unknown=21, NotChecked=118, Total=3782 [2023-12-02 20:53:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:53:56,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:53:56,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:53:56,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:53:56,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:53:56,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:53:56,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:53:56,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:54:04,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:05,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:11,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:59,970 WARN L293 SmtUtils]: Spent 34.03s on a formula simplification. DAG size of input: 1527 DAG size of output: 579 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:55:12,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:14,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:26,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:28,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:30,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:31,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:34,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:35,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:37,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:41,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:42,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:44,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:46,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:40,889 WARN L293 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 1283 DAG size of output: 962 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:57:42,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:43,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:45,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:50,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:52,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:55,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:55,547 WARN L293 SmtUtils]: Spent 1.69m on a formula simplification. DAG size of input: 1375 DAG size of output: 969 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:59:57,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:59,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:00:03,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:00:06,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:00:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:38,028 WARN L293 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 1356 DAG size of output: 1283 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 21:01:39,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:41,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:46,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:48,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:54,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:01:57,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:02,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:05,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:07,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:09,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:12,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:15,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:19,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:28,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:31,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:40,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:42,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:48,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:02:52,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:03:00,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:03:02,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 21:03:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:05,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 21:03:05,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 21:03:05,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 21:03:05,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 21:03:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 889262249, now seen corresponding path program 3 times [2023-12-02 21:03:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 21:03:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207457797] [2023-12-02 21:03:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 21:03:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:03:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:03:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 21:03:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 21:03:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207457797] [2023-12-02 21:03:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207457797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 21:03:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712595079] [2023-12-02 21:03:06,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 21:03:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 21:03:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 21:03:06,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 21:03:06,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 21:03:06,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 21:03:06,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 21:03:06,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 21:03:06,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 21:03:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 21:03:07,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 21:03:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 21:03:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712595079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 21:03:08,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 21:03:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-12-02 21:03:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376811589] [2023-12-02 21:03:08,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 21:03:08,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 21:03:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 21:03:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 21:03:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2023-12-02 21:03:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 21:03:08,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 21:03:08,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 21:03:08,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:08,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:08,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:08,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:08,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:08,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 21:03:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 21:03:09,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 21:03:09,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 21:03:09,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 21:03:09,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 21:03:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1636530562, now seen corresponding path program 4 times [2023-12-02 21:03:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 21:03:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001891931] [2023-12-02 21:03:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 21:03:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:03:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:03:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:03:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 21:03:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001891931] [2023-12-02 21:03:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001891931] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 21:03:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841782521] [2023-12-02 21:03:10,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 21:03:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 21:03:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 21:03:10,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 21:03:10,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 21:03:10,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 21:03:10,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 21:03:10,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 21:03:10,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 21:03:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 21:03:11,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 21:03:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 21:03:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841782521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 21:03:12,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 21:03:12,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2023-12-02 21:03:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744208893] [2023-12-02 21:03:12,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 21:03:12,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 21:03:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 21:03:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 21:03:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 21:03:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 21:03:12,290 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 21:03:12,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 21:03:12,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 21:03:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 21:03:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 21:03:17,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 21:03:17,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 21:03:17,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 21:03:17,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 21:03:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash 11289481, now seen corresponding path program 5 times [2023-12-02 21:03:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 21:03:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065107534] [2023-12-02 21:03:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 21:03:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:03:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:03:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 64 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:03:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 21:03:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065107534] [2023-12-02 21:03:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065107534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 21:03:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600448021] [2023-12-02 21:03:19,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-02 21:03:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 21:03:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 21:03:19,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 21:03:19,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01571a85-1513-4a9c-ab72-9777cc3f8987/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 21:03:19,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-12-02 21:03:19,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 21:03:19,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 21:03:19,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 21:03:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 21:03:21,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 21:03:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 21:03:23,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600448021] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 21:03:23,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 21:03:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15, 15] total 55 [2023-12-02 21:03:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371866413] [2023-12-02 21:03:23,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 21:03:23,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 21:03:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 21:03:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 21:03:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2023-12-02 21:03:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 21:03:23,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 21:03:23,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.8214285714285716) internal successors, (214), 55 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 21:03:23,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 21:03:23,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 21:03:23,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 21:03:23,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 21:03:23,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 21:03:23,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 21:03:23,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-12-02 21:03:23,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.