./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-04 12:06:38,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-04 12:06:38,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-04 12:06:38,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-04 12:06:38,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-04 12:06:38,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-04 12:06:38,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-04 12:06:38,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-04 12:06:38,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-04 12:06:38,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-04 12:06:38,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-04 12:06:38,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-04 12:06:38,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-04 12:06:38,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-04 12:06:38,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-04 12:06:38,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-04 12:06:38,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-04 12:06:38,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-04 12:06:38,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-04 12:06:38,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-04 12:06:38,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-04 12:06:38,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-04 12:06:38,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-04 12:06:38,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-04 12:06:38,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-04 12:06:38,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-04 12:06:38,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-04 12:06:38,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-04 12:06:38,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-04 12:06:38,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-04 12:06:38,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-04 12:06:38,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-04 12:06:38,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-04 12:06:38,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-04 12:06:38,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-04 12:06:38,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-04 12:06:38,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-04 12:06:38,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-04 12:06:38,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-04 12:06:38,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-04 12:06:38,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-04 12:06:38,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-04 12:06:38,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-04 12:06:38,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-04 12:06:38,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-04 12:06:38,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-04 12:06:38,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-04 12:06:38,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-04 12:06:38,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-04 12:06:38,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-04 12:06:38,881 INFO L138 SettingsManager]: * Use SBE=true [2022-11-04 12:06:38,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-04 12:06:38,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-04 12:06:38,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-04 12:06:38,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-04 12:06:38,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-04 12:06:38,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-04 12:06:38,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-04 12:06:38,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-04 12:06:38,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-04 12:06:38,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-04 12:06:38,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-04 12:06:38,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-04 12:06:38,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-04 12:06:38,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-04 12:06:38,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-04 12:06:38,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-04 12:06:38,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:06:38,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-04 12:06:38,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-04 12:06:38,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-04 12:06:38,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-04 12:06:38,888 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-04 12:06:38,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-04 12:06:38,888 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-04 12:06:38,888 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-04 12:06:38,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-04 12:06:38,889 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-04 12:06:38,889 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-04 12:06:38,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/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_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2022-11-04 12:06:39,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-04 12:06:39,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-04 12:06:39,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-04 12:06:39,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-04 12:06:39,275 INFO L275 PluginConnector]: CDTParser initialized [2022-11-04 12:06:39,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-04 12:06:39,355 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/data/4322485a5/4dd608cb2c214ffe94aacc38a760624a/FLAG7ed1efd05 [2022-11-04 12:06:39,890 INFO L306 CDTParser]: Found 1 translation units. [2022-11-04 12:06:39,903 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-04 12:06:39,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/data/4322485a5/4dd608cb2c214ffe94aacc38a760624a/FLAG7ed1efd05 [2022-11-04 12:06:40,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/data/4322485a5/4dd608cb2c214ffe94aacc38a760624a [2022-11-04 12:06:40,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-04 12:06:40,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-04 12:06:40,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-04 12:06:40,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-04 12:06:40,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-04 12:06:40,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cc1f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40, skipping insertion in model container [2022-11-04 12:06:40,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-04 12:06:40,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-04 12:06:40,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-04 12:06:40,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:06:40,634 INFO L203 MainTranslator]: Completed pre-run [2022-11-04 12:06:40,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-04 12:06:40,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:06:40,678 INFO L208 MainTranslator]: Completed translation [2022-11-04 12:06:40,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40 WrapperNode [2022-11-04 12:06:40,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-04 12:06:40,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-04 12:06:40,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-04 12:06:40,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-04 12:06:40,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,716 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-11-04 12:06:40,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-04 12:06:40,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-04 12:06:40,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-04 12:06:40,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-04 12:06:40,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-04 12:06:40,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-04 12:06:40,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-04 12:06:40,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-04 12:06:40,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (1/1) ... [2022-11-04 12:06:40,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:06:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:40,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-04 12:06:40,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-04 12:06:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-04 12:06:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-04 12:06:40,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-04 12:06:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-04 12:06:40,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-04 12:06:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-04 12:06:40,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-04 12:06:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-04 12:06:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-04 12:06:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-04 12:06:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-04 12:06:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-04 12:06:40,845 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-04 12:06:41,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-04 12:06:41,030 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-04 12:06:41,342 INFO L276 CfgBuilder]: Performing block encoding [2022-11-04 12:06:41,426 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-04 12:06:41,432 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-04 12:06:41,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:06:41 BoogieIcfgContainer [2022-11-04 12:06:41,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-04 12:06:41,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-04 12:06:41,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-04 12:06:41,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-04 12:06:41,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:06:40" (1/3) ... [2022-11-04 12:06:41,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75740717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:06:41, skipping insertion in model container [2022-11-04 12:06:41,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:40" (2/3) ... [2022-11-04 12:06:41,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75740717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:06:41, skipping insertion in model container [2022-11-04 12:06:41,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:06:41" (3/3) ... [2022-11-04 12:06:41,445 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-04 12:06:41,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-04 12:06:41,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-04 12:06:41,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-04 12:06:41,468 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-04 12:06:41,550 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-04 12:06:41,609 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:06:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:41,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:06:41,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-04 12:06:41,675 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:06:41,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-04 12:06:41,699 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1695117d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:41,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-04 12:06:41,998 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)] === [2022-11-04 12:06:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1913046396, now seen corresponding path program 1 times [2022-11-04 12:06:42,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:42,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398492029] [2022-11-04 12:06:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398492029] [2022-11-04 12:06:42,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398492029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:42,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:42,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:06:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48857663] [2022-11-04 12:06:42,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:42,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:06:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:06:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:06:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:42,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:06:42,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-04 12:06:42,376 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)] === [2022-11-04 12:06:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1072958743, now seen corresponding path program 1 times [2022-11-04 12:06:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:42,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508605572] [2022-11-04 12:06:42,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508605572] [2022-11-04 12:06:42,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508605572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:42,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:42,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-04 12:06:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114705346] [2022-11-04 12:06:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-04 12:06:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-04 12:06:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-04 12:06:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:42,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:06:42,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-04 12:06:42,993 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)] === [2022-11-04 12:06:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1680602829, now seen corresponding path program 1 times [2022-11-04 12:06:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:42,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261329013] [2022-11-04 12:06:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261329013] [2022-11-04 12:06:43,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261329013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:43,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:43,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-04 12:06:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656328187] [2022-11-04 12:06:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:43,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-04 12:06:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-04 12:06:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-04 12:06:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:43,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:43,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:06:43,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:43,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:43,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:06:43,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-04 12:06:43,761 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)] === [2022-11-04 12:06:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1113050308, now seen corresponding path program 1 times [2022-11-04 12:06:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545513866] [2022-11-04 12:06:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:44,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545513866] [2022-11-04 12:06:44,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545513866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73132388] [2022-11-04 12:06:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:44,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:44,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:44,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:44,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-04 12:06:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:44,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-04 12:06:44,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:44,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:44,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73132388] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:44,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-04 12:06:44,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-04 12:06:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217121919] [2022-11-04 12:06:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:44,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-04 12:06:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:44,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-04 12:06:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-04 12:06:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:44,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:44,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:06:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:06:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:06:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:06:44,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-04 12:06:45,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:45,115 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)] === [2022-11-04 12:06:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1740696653, now seen corresponding path program 1 times [2022-11-04 12:06:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:45,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706877407] [2022-11-04 12:06:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706877407] [2022-11-04 12:06:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706877407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081480351] [2022-11-04 12:06:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:45,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:45,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-04 12:06:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:45,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-04 12:06:45,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:45,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:46,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081480351] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:46,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-04 12:06:46,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-04 12:06:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758211959] [2022-11-04 12:06:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:46,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-04 12:06:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:46,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-04 12:06:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-04 12:06:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:46,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:46,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:06:46,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:46,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:46,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:06:46,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:06:46,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:06:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:06:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:06:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:46,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:46,475 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)] === [2022-11-04 12:06:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash 172734548, now seen corresponding path program 1 times [2022-11-04 12:06:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:46,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507681765] [2022-11-04 12:06:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:48,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507681765] [2022-11-04 12:06:48,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507681765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:48,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395378032] [2022-11-04 12:06:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:48,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:48,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-04 12:06:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:48,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-04 12:06:48,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:49,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-04 12:06:50,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:06:51,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:06:51,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:06:51,679 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-04 12:06:51,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-11-04 12:06:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:06:52,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:54,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset))) (or (not (< .cse1 c_~min1~0)) (= .cse1 c_~min3~0) (< (select .cse2 .cse3) c_~min3~0)))))) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset)) (.cse4 (select .cse6 .cse3))) (or (not (< .cse4 c_~min2~0)) (not (< .cse5 c_~min1~0)) (= .cse4 .cse5) (not (< .cse4 c_~min3~0)))))) (or (= c_~min1~0 c_~min3~0) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (or (< (select .cse7 c_~A~0.offset) c_~min1~0) (< (select .cse7 .cse3) c_~min3~0)))) .cse0) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse3))) (or (not (< .cse8 c_~min2~0)) (= .cse8 c_~min1~0) (not (< .cse8 c_~min3~0)) (< (select .cse9 c_~A~0.offset) c_~min1~0))))))) is different from false [2022-11-04 12:06:54,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (not (< c_~min3~0 c_~min2~0)))) (and (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= .cse0 c_~min3~0) (not (< .cse0 c_~min1~0)) (< (select .cse1 .cse2) c_~min3~0))))) .cse3) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset)) (.cse5 (select .cse6 .cse2))) (or (= .cse4 .cse5) (not (< .cse4 c_~min1~0)) (not (< .cse5 c_~min3~0)) (not (< .cse5 c_~min2~0)))))) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2))) (or (= c_~min1~0 .cse7) (not (< .cse7 c_~min3~0)) (not (< .cse7 c_~min2~0)) (< (select .cse8 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (or (< (select .cse9 .cse2) c_~min3~0) (< (select .cse9 c_~A~0.offset) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse3))) is different from false [2022-11-04 12:06:55,091 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (not (< c_~min3~0 c_~min2~0)))) (and (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= .cse0 c_~min3~0) (not (< .cse0 c_~min1~0)) (< (select .cse1 .cse2) c_~min3~0))))) .cse3) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset)) (.cse5 (select .cse6 .cse2))) (or (= .cse4 .cse5) (not (< .cse4 c_~min1~0)) (not (< .cse5 c_~min3~0)) (not (< .cse5 c_~min2~0)))))) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2))) (or (= c_~min1~0 .cse7) (not (< .cse7 c_~min3~0)) (not (< .cse7 c_~min2~0)) (< (select .cse8 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (or (< (select .cse9 .cse2) c_~min3~0) (< (select .cse9 c_~A~0.offset) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse3)))) is different from false [2022-11-04 12:06:55,183 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (not (< c_~min3~0 c_~min2~0)))) (and (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= .cse0 c_~min3~0) (not (< .cse0 c_~min1~0)) (< (select .cse1 .cse2) c_~min3~0))))) .cse3) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset)) (.cse5 (select .cse6 .cse2))) (or (= .cse4 .cse5) (not (< .cse4 c_~min1~0)) (not (< .cse5 c_~min3~0)) (not (< .cse5 c_~min2~0)))))) (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2))) (or (= c_~min1~0 .cse7) (not (< .cse7 c_~min3~0)) (not (< .cse7 c_~min2~0)) (< (select .cse8 c_~A~0.offset) c_~min1~0))))) (or (forall ((v_ArrVal_142 (Array Int Int)) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_143 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_143) c_~A~0.base))) (or (< (select .cse9 .cse2) c_~min3~0) (< (select .cse9 c_~A~0.offset) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse3)))) is different from false [2022-11-04 12:06:59,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-11-04 12:06:59,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2187 treesize of output 2101 [2022-11-04 12:06:59,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2091 treesize of output 2037 [2022-11-04 12:06:59,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2027 treesize of output 1909 [2022-11-04 12:06:59,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1899 treesize of output 1653 [2022-11-04 12:07:05,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:05,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 91 [2022-11-04 12:07:05,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:05,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4759 treesize of output 4545 [2022-11-04 12:07:05,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:05,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4535 treesize of output 3905 [2022-11-04 12:07:05,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:05,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3895 treesize of output 3585 [2022-11-04 12:07:05,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:05,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2755 treesize of output 2605 [2022-11-04 12:08:20,790 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:08:20,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2022-11-04 12:08:20,802 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:08:20,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 1 [2022-11-04 12:08:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:08:22,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395378032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:08:22,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:08:22,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 81 [2022-11-04 12:08:22,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152120195] [2022-11-04 12:08:22,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:08:22,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-04 12:08:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:08:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-04 12:08:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=5035, Unknown=58, NotChecked=612, Total=6480 [2022-11-04 12:08:22,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:22,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:08:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.2592592592592595) internal successors, (345), 81 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:08:22,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:08:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:08:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:08:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:08:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-04 12:08:30,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-04 12:08:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-04 12:08:30,814 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)] === [2022-11-04 12:08:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:08:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -434909538, now seen corresponding path program 1 times [2022-11-04 12:08:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:08:30,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343394402] [2022-11-04 12:08:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:08:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:08:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:08:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:08:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:08:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343394402] [2022-11-04 12:08:32,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343394402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:08:32,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225628843] [2022-11-04 12:08:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:08:32,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:08:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:08:32,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:08:32,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-04 12:08:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:08:32,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-04 12:08:32,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:08:32,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:08:32,676 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:08:32,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-04 12:08:33,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:08:33,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-04 12:08:33,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-04 12:08:34,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:08:34,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:08:34,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:08:35,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:35,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-04 12:08:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:08:36,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:08:37,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (< c_~min3~0 c_~min2~0)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (= c_~min2~0 .cse0) (forall ((~M~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (not (< .cse0 c_~min1~0)))))) (or (forall ((v_ArrVal_182 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (= c_~min2~0 .cse4) (< (select .cse5 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse4 c_~min1~0)) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) .cse6) (or (= c_~min2~0 c_~min1~0) (and (or (forall ((v_ArrVal_182 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (or (< (select .cse7 .cse3) c_~min1~0) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) .cse6) (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) c_~A~0.base))) (or (< (select .cse8 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse9 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse9 c_~min3~0)) (< .cse9 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))))))))) is different from false [2022-11-04 12:08:41,165 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0) (not (< .cse1 c_~min1~0)) (= c_~min2~0 .cse1) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (~M~0 Int) (v_ArrVal_181 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (< (select .cse3 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< .cse4 c_~min1~0)) (= c_~min2~0 .cse4) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (= c_~min2~0 c_~min1~0) (and (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< 0 ~M~0) (< (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (+ ~M~0 1) c_~N~0)))) .cse5) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse8 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< 0 ~M~0) (not (< .cse8 c_~min3~0)) (< .cse8 c_~min2~0) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-04 12:08:41,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min2~0 .cse0) (< 0 ~M~0) (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0) (not (< .cse0 c_~min1~0)) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (~M~0 Int) (v_ArrVal_181 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min2~0 .cse3) (< 0 ~M~0) (< (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse3 c_~min1~0)) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (= c_~min2~0 c_~min1~0) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (not (< .cse6 c_~min3~0)) (< (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< .cse6 c_~min2~0) (< (+ ~M~0 1) c_~N~0))))) (or .cse5 (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (< (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-04 12:08:42,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:42,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-11-04 12:08:42,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:42,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4503 treesize of output 4321 [2022-11-04 12:08:42,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:42,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3267 treesize of output 3149 [2022-11-04 12:08:42,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:42,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4183 treesize of output 3681 [2022-11-04 12:08:42,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:08:42,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3671 treesize of output 3425 [2022-11-04 12:09:03,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:03,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2022-11-04 12:09:03,517 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-04 12:09:03,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6977 treesize of output 6661 [2022-11-04 12:09:03,646 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-04 12:09:03,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6657 treesize of output 6213 [2022-11-04 12:09:03,785 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-04 12:09:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4237 treesize of output 4017 [2022-11-04 12:09:03,909 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-04 12:09:03,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5985 treesize of output 5093 [2022-11-04 12:09:37,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:37,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-11-04 12:09:37,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:37,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1083 treesize of output 1045 [2022-11-04 12:09:37,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:37,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1035 treesize of output 917 [2022-11-04 12:09:37,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:37,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 907 treesize of output 885 [2022-11-04 12:09:37,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:37,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 875 treesize of output 821 [2022-11-04 12:09:40,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:09:40,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2022-11-04 12:09:40,437 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-04 12:09:40,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 364 [2022-11-04 12:09:40,455 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-04 12:09:40,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 359 treesize of output 319 [2022-11-04 12:09:40,473 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-04 12:09:40,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 299 [2022-11-04 12:09:40,492 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-04 12:09:40,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 195 [2022-11-04 12:09:42,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-04 12:09:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:42,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225628843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:09:42,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:09:42,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 35, 33] total 83 [2022-11-04 12:09:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884023084] [2022-11-04 12:09:42,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:09:42,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-04 12:09:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:09:42,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-04 12:09:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=5104, Unknown=90, NotChecked=474, Total=6806 [2022-11-04 12:09:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:42,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:09:42,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.036144578313253) internal successors, (335), 83 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:09:42,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:42,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:42,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:42,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:42,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:09:42,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-04 12:09:42,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:09:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-04 12:09:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-04 12:09:51,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-04 12:09:51,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:09:51,937 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)] === [2022-11-04 12:09:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:09:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1636392351, now seen corresponding path program 2 times [2022-11-04 12:09:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:09:51,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891844787] [2022-11-04 12:09:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:09:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:09:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:09:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:09:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891844787] [2022-11-04 12:09:52,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891844787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:09:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049711406] [2022-11-04 12:09:52,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:09:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:09:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:09:52,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:09:52,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-04 12:09:52,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:09:52,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:09:52,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-04 12:09:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:09:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-04 12:09:53,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:09:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-04 12:09:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049711406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:09:53,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:09:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2022-11-04 12:09:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508145828] [2022-11-04 12:09:53,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:09:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-04 12:09:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:09:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-04 12:09:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2022-11-04 12:09:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:53,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:09:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:09:53,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-04 12:09:53,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:09:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-04 12:09:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-04 12:09:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-04 12:09:56,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-04 12:09:56,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:09:56,345 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:09:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:09:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 145022735, now seen corresponding path program 3 times [2022-11-04 12:09:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:09:56,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923049905] [2022-11-04 12:09:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:09:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:09:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:09:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:09:56,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923049905] [2022-11-04 12:09:56,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923049905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:09:56,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494610326] [2022-11-04 12:09:56,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-04 12:09:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:09:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:09:56,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:09:56,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-04 12:09:56,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-04 12:09:56,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:09:56,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-04 12:09:56,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:09:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:57,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:09:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494610326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:09:57,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:09:57,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-04 12:09:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321397327] [2022-11-04 12:09:57,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:09:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-04 12:09:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:09:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-04 12:09:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-04 12:09:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:57,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:09:57,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.25) internal successors, (222), 24 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:09:57,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:57,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:57,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:57,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:57,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:09:57,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-04 12:09:57,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-04 12:09:57,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-04 12:09:57,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:09:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-04 12:09:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-04 12:09:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-04 12:09:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-04 12:09:58,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-04 12:09:59,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-04 12:09:59,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:09:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:09:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -370468642, now seen corresponding path program 1 times [2022-11-04 12:09:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:09:59,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793243202] [2022-11-04 12:09:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:09:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:09:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:09:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:09:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793243202] [2022-11-04 12:09:59,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793243202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:09:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637374088] [2022-11-04 12:09:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:09:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:09:59,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:09:59,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:09:59,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-04 12:09:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:09:59,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-04 12:09:59,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:09:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:09:59,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:10:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:00,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637374088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:10:00,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:10:00,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-11-04 12:10:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902147435] [2022-11-04 12:10:00,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:10:00,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-04 12:10:00,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:10:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-04 12:10:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-11-04 12:10:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:00,271 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:10:00,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.193548387096774) internal successors, (254), 31 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-04 12:10:00,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:10:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:10:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:10:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:10:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:10:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:10:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-04 12:10:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:10:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:10:14,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-04 12:10:14,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-04 12:10:14,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:10:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:10:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 308014168, now seen corresponding path program 4 times [2022-11-04 12:10:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:10:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031140500] [2022-11-04 12:10:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:10:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:10:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:10:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:10:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031140500] [2022-11-04 12:10:15,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031140500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:10:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071633108] [2022-11-04 12:10:15,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-04 12:10:15,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:10:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:10:15,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:10:15,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-04 12:10:15,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-04 12:10:15,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:10:15,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-04 12:10:15,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:10:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:15,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:10:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071633108] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:10:15,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:10:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2022-11-04 12:10:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172185567] [2022-11-04 12:10:15,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:10:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-04 12:10:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:10:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-04 12:10:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-11-04 12:10:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:15,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:10:15,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.928571428571429) internal successors, (222), 28 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:10:15,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:15,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:10:15,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:10:15,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:10:15,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:10:15,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:10:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-04 12:10:17,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-04 12:10:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-04 12:10:17,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:10:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:10:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash 628248351, now seen corresponding path program 5 times [2022-11-04 12:10:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:10:17,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677144345] [2022-11-04 12:10:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:10:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:10:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:10:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:10:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677144345] [2022-11-04 12:10:22,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677144345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:10:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473243544] [2022-11-04 12:10:22,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-04 12:10:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:10:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:10:22,023 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:10:22,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-04 12:10:22,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-04 12:10:22,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:10:22,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-04 12:10:22,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:10:22,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:10:22,327 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-04 12:10:22,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-04 12:10:22,953 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:10:22,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-04 12:10:23,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-04 12:10:24,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:10:24,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:10:24,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:10:26,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:10:26,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:10:26,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-11-04 12:10:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:10:28,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:10:37,408 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse67 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ c_~A~0.offset .cse67)) (.cse4 (+ c_~A~0.offset .cse67 4))) (and (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (* ~M~0 4)) (.cse2 (select .cse0 .cse4))) (or (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min3~0) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~min3~0) (not (< .cse2 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse0 .cse3) c_~min1~0) (= c_~min3~0 .cse2))))) .cse5) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int))) (let ((.cse7 (* ~M~0 4)) (.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse6 (+ c_~A~0.offset .cse7)) c_~min3~0) (< (select .cse6 (+ c_~A~0.offset .cse7 4)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse6 .cse3) c_~min1~0) (< (select .cse6 .cse4) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse5) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse8 (select .cse11 .cse4))) (or (not (< .cse8 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse12 (* ~M~0 4))) (let ((.cse9 (select .cse11 (+ c_~A~0.offset .cse12 4))) (.cse10 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (not (< .cse9 c_~min2~0)) (not (< .cse9 .cse10)) (= .cse9 .cse8) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse10 c_~min3~0)))))) (< (select .cse11 .cse3) c_~min1~0))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse14 (* ~M~0 4)) (.cse15 (select .cse13 .cse3))) (or (< (select .cse13 (+ c_~A~0.offset .cse14)) c_~min3~0) (< (select .cse13 .cse4) .cse15) (< (select .cse13 (+ c_~A~0.offset .cse14 4)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse15 c_~min1~0)) (= c_~min3~0 .cse15))))) .cse5) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse17 (* ~M~0 4))) (let ((.cse18 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (or (< (select .cse16 (+ c_~A~0.offset .cse17)) c_~min3~0) (not (< .cse18 c_~min2~0)) (= c_~min1~0 .cse18) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse18 c_~min3~0)))))) (< (select .cse16 .cse3) c_~min1~0) (< (select .cse16 .cse4) c_~min1~0)))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse20 (select .cse19 .cse3))) (or (< (select .cse19 .cse4) .cse20) (not (< .cse20 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse21 (select .cse19 (+ c_~A~0.offset .cse23 4))) (.cse22 (select .cse19 (+ c_~A~0.offset .cse23)))) (or (not (< .cse21 c_~min2~0)) (not (< .cse21 .cse22)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse21 .cse20) (not (< .cse22 c_~min3~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse27 (select .cse24 .cse4)) (.cse28 (select .cse24 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse25 (* ~M~0 4))) (let ((.cse26 (select .cse24 (+ c_~A~0.offset .cse25 4)))) (or (< (select .cse24 (+ c_~A~0.offset .cse25)) c_~min3~0) (not (< .cse26 c_~min2~0)) (= .cse26 .cse27) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse26 c_~min3~0)))))) (not (< .cse28 c_~min1~0)) (not (< .cse27 .cse28)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse4)) (.cse34 (select .cse32 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse33 (* ~M~0 4))) (let ((.cse29 (select .cse32 (+ c_~A~0.offset .cse33 4))) (.cse30 (select .cse32 (+ c_~A~0.offset .cse33)))) (or (not (< .cse29 c_~min2~0)) (not (< .cse29 .cse30)) (= .cse29 .cse31) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse30 c_~min3~0)))))) (not (< .cse34 c_~min1~0)) (not (< .cse31 .cse34)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse37 (* ~M~0 4))) (let ((.cse35 (select .cse36 (+ c_~A~0.offset .cse37)))) (or (not (< .cse35 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse35) (not (< .cse35 c_~min3~0)) (< (select .cse36 (+ c_~A~0.offset .cse37 4)) .cse35))))) (< (select .cse36 .cse3) c_~min1~0) (< (select .cse36 .cse4) c_~min1~0)))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse39 (select .cse38 .cse3))) (or (< (select .cse38 .cse4) .cse39) (forall ((~M~0 Int)) (let ((.cse40 (* ~M~0 4))) (let ((.cse41 (select .cse38 (+ c_~A~0.offset .cse40 4)))) (or (< (select .cse38 (+ c_~A~0.offset .cse40)) c_~min3~0) (not (< .cse41 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse41 .cse39) (not (< .cse41 c_~min3~0)))))) (not (< .cse39 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse43 (* ~M~0 4)) (.cse44 (select .cse42 .cse4)) (.cse45 (select .cse42 .cse3))) (or (< (select .cse42 (+ c_~A~0.offset .cse43)) c_~min3~0) (< (select .cse42 (+ c_~A~0.offset .cse43 4)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= c_~min3~0 .cse44) (not (< .cse45 c_~min1~0)) (not (< .cse44 .cse45)))))) .cse5) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse49 (select .cse46 .cse4))) (or (forall ((~M~0 Int)) (let ((.cse47 (* ~M~0 4))) (let ((.cse48 (select .cse46 (+ c_~A~0.offset .cse47 4)))) (or (< (select .cse46 (+ c_~A~0.offset .cse47)) c_~min3~0) (not (< .cse48 c_~min2~0)) (= .cse48 .cse49) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min3~0)))))) (not (< .cse49 c_~min1~0)) (< (select .cse46 .cse3) c_~min1~0))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse4)) (.cse54 (select .cse52 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse53 (* ~M~0 4))) (let ((.cse50 (select .cse52 (+ c_~A~0.offset .cse53)))) (or (not (< .cse50 c_~min2~0)) (= .cse50 .cse51) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse50 c_~min3~0)) (< (select .cse52 (+ c_~A~0.offset .cse53 4)) .cse50))))) (not (< .cse54 c_~min1~0)) (not (< .cse51 .cse54)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse3))) (or (< (select .cse55 .cse4) .cse56) (forall ((~M~0 Int)) (let ((.cse58 (* ~M~0 4))) (let ((.cse57 (select .cse55 (+ c_~A~0.offset .cse58)))) (or (not (< .cse57 c_~min2~0)) (= .cse57 .cse56) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse57 c_~min3~0)) (< (select .cse55 (+ c_~A~0.offset .cse58 4)) .cse57))))) (not (< .cse56 c_~min1~0)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse60 (select .cse61 .cse4))) (or (forall ((~M~0 Int)) (let ((.cse62 (* ~M~0 4))) (let ((.cse59 (select .cse61 (+ c_~A~0.offset .cse62)))) (or (not (< .cse59 c_~min2~0)) (= .cse59 .cse60) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min3~0)) (< (select .cse61 (+ c_~A~0.offset .cse62 4)) .cse59))))) (not (< .cse60 c_~min1~0)) (< (select .cse61 .cse3) c_~min1~0))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse66 (* ~M~0 4))) (let ((.cse63 (select .cse65 (+ c_~A~0.offset .cse66 4))) (.cse64 (select .cse65 (+ c_~A~0.offset .cse66)))) (or (not (< .cse63 c_~min2~0)) (not (< .cse63 .cse64)) (= c_~min1~0 .cse63) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 c_~min3~0)))))) (< (select .cse65 .cse3) c_~min1~0) (< (select .cse65 .cse4) c_~min1~0))))))) (not (< (+ c_thread1Thread1of1ForFork2_~i~0 1) c_~N~0))) is different from false [2022-11-04 12:10:41,598 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse67 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse28 (not (< c_~min3~0 c_~min2~0))) (.cse6 (+ c_~A~0.offset .cse67)) (.cse5 (+ c_~A~0.offset .cse67 4))) (and (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse4 (* ~M~0 4))) (let ((.cse2 (select .cse3 (+ c_~A~0.offset .cse4))) (.cse0 (select .cse3 (+ c_~A~0.offset .cse4 4)))) (or (= .cse0 .cse1) (not (< .cse0 .cse2)) (not (< .cse2 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse0 c_~min2~0)))))) (not (< .cse1 c_~min1~0)) (< (select .cse3 .cse5) .cse1))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse7 (select .cse11 .cse6)) (.cse8 (select .cse11 .cse5))) (or (not (< .cse7 c_~min1~0)) (not (< .cse8 .cse7)) (forall ((~M~0 Int)) (let ((.cse12 (* ~M~0 4))) (let ((.cse10 (select .cse11 (+ c_~A~0.offset .cse12))) (.cse9 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (or (not (< .cse9 .cse10)) (not (< .cse10 c_~min3~0)) (= .cse9 .cse8) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse9 c_~min2~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse16 (select .cse13 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse14 (* ~M~0 4))) (let ((.cse15 (select .cse13 (+ c_~A~0.offset .cse14)))) (or (< (select .cse13 (+ c_~A~0.offset .cse14 4)) .cse15) (= .cse15 .cse16) (not (< .cse15 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse15 c_~min2~0)))))) (not (< .cse16 c_~min1~0)) (< (select .cse13 .cse5) .cse16))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5))) (or (not (< .cse17 c_~min1~0)) (< (select .cse18 .cse6) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse19 (* ~M~0 4))) (let ((.cse20 (select .cse18 (+ c_~A~0.offset .cse19 4)))) (or (< (select .cse18 (+ c_~A~0.offset .cse19)) c_~min3~0) (= .cse20 .cse17) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse20 c_~min3~0)) (not (< .cse20 c_~min2~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse6))) (or (not (< .cse21 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse24 (* ~M~0 4))) (let ((.cse22 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (or (= .cse22 .cse21) (< (select .cse23 (+ c_~A~0.offset .cse24)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse22 c_~min3~0)) (not (< .cse22 c_~min2~0)))))) (< (select .cse23 .cse5) .cse21))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse26 (* ~M~0 4)) (.cse27 (select .cse25 .cse6))) (or (< (select .cse25 (+ c_~A~0.offset .cse26)) c_~min3~0) (= c_~min3~0 .cse27) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse25 (+ c_~A~0.offset .cse26 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse27 c_~min1~0)) (< (select .cse25 .cse5) .cse27))))) .cse28) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse29 .cse6) c_~min1~0) (< (select .cse29 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse30 (* ~M~0 4))) (let ((.cse31 (select .cse29 (+ c_~A~0.offset .cse30 4)))) (or (< (select .cse29 (+ c_~A~0.offset .cse30)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse31 c_~min3~0)) (not (< .cse31 c_~min2~0)) (= c_~min1~0 .cse31)))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse6)) (.cse33 (select .cse34 .cse5))) (or (not (< .cse32 c_~min1~0)) (not (< .cse33 .cse32)) (forall ((~M~0 Int)) (let ((.cse35 (* ~M~0 4))) (let ((.cse36 (select .cse34 (+ c_~A~0.offset .cse35)))) (or (< (select .cse34 (+ c_~A~0.offset .cse35 4)) .cse36) (not (< .cse36 c_~min3~0)) (= .cse36 .cse33) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse36 c_~min2~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse37 .cse6) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse38 (* ~M~0 4))) (let ((.cse39 (select .cse37 (+ c_~A~0.offset .cse38)))) (or (< (select .cse37 (+ c_~A~0.offset .cse38 4)) .cse39) (not (< .cse39 c_~min3~0)) (= c_~min1~0 .cse39) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse39 c_~min2~0)))))) (< (select .cse37 .cse5) c_~min1~0)))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse40 .cse6) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse43 (* ~M~0 4))) (let ((.cse42 (select .cse40 (+ c_~A~0.offset .cse43))) (.cse41 (select .cse40 (+ c_~A~0.offset .cse43 4)))) (or (not (< .cse41 .cse42)) (not (< .cse42 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse41 c_~min2~0)) (= c_~min1~0 .cse41))))) (< (select .cse40 .cse5) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse46 (* ~M~0 4)) (.cse44 (select .cse45 .cse5))) (or (not (< .cse44 c_~min1~0)) (< (select .cse45 (+ c_~A~0.offset .cse46)) c_~min3~0) (< (select .cse45 .cse6) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse45 (+ c_~A~0.offset .cse46 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min3~0 .cse44))))) .cse28) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse48 (* ~M~0 4)) (.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse47 (+ c_~A~0.offset .cse48)) c_~min3~0) (< (select .cse47 .cse6) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse47 (+ c_~A~0.offset .cse48 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse47 .cse5) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse28) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse49 (select .cse50 .cse5))) (or (not (< .cse49 c_~min1~0)) (< (select .cse50 .cse6) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse52 (select .cse50 (+ c_~A~0.offset .cse51)))) (or (< (select .cse50 (+ c_~A~0.offset .cse51 4)) .cse52) (not (< .cse52 c_~min3~0)) (= .cse52 .cse49) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse52 c_~min2~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse56 (select .cse53 .cse5)) (.cse57 (select .cse53 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse54 (* ~M~0 4))) (let ((.cse55 (select .cse53 (+ c_~A~0.offset .cse54 4)))) (or (< (select .cse53 (+ c_~A~0.offset .cse54)) c_~min3~0) (= .cse55 .cse56) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse55 c_~min3~0)) (not (< .cse55 c_~min2~0)))))) (not (< .cse57 c_~min1~0)) (not (< .cse56 .cse57)))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse59 (* ~M~0 4)) (.cse61 (select .cse58 .cse5)) (.cse60 (select .cse58 .cse6))) (or (< (select .cse58 (+ c_~A~0.offset .cse59)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse58 (+ c_~A~0.offset .cse59 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse60 c_~min1~0)) (= c_~min3~0 .cse61) (not (< .cse61 .cse60)))))) .cse28) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse62 (select .cse63 .cse5))) (or (not (< .cse62 c_~min1~0)) (< (select .cse63 .cse6) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse66 (* ~M~0 4))) (let ((.cse65 (select .cse63 (+ c_~A~0.offset .cse66))) (.cse64 (select .cse63 (+ c_~A~0.offset .cse66 4)))) (or (not (< .cse64 .cse65)) (not (< .cse65 c_~min3~0)) (= .cse64 .cse62) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 c_~min2~0))))))))))))) (not (< (+ c_thread1Thread1of1ForFork2_~i~0 1) c_~N~0))) is different from false [2022-11-04 12:10:44,558 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse4 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ c_~A~0.offset 4))) (and (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (* ~M~0 4)) (.cse2 (select .cse0 c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min3~0) (not (< .cse2 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse0 .cse3) .cse2) (= .cse2 c_~min3~0))))) .cse4) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse5 c_~A~0.offset) c_~min1~0) (< (select .cse5 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse6 (* ~M~0 4))) (let ((.cse7 (select .cse5 (+ c_~A~0.offset .cse6)))) (or (< (select .cse5 (+ c_~A~0.offset .cse6 4)) .cse7) (not (< .cse7 c_~min3~0)) (= c_~min1~0 .cse7) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse7 c_~min2~0))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset .cse11))) (.cse8 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (or (not (< .cse8 .cse9)) (not (< .cse9 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse8 c_~min2~0)) (= c_~min1~0 .cse8))))) (< (select .cse10 c_~A~0.offset) c_~min1~0) (< (select .cse10 .cse3) c_~min1~0)))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse15 (select .cse12 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse13 (* ~M~0 4))) (let ((.cse14 (select .cse12 (+ c_~A~0.offset .cse13 4)))) (or (< (select .cse12 (+ c_~A~0.offset .cse13)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse14 c_~min3~0)) (= .cse15 .cse14) (not (< .cse14 c_~min2~0)))))) (not (< .cse15 c_~min1~0)) (< (select .cse12 .cse3) .cse15))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset)) (.cse16 (select .cse18 .cse3))) (or (not (< .cse16 .cse17)) (not (< .cse17 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse19 (* ~M~0 4))) (let ((.cse20 (select .cse18 (+ c_~A~0.offset .cse19 4)))) (or (< (select .cse18 (+ c_~A~0.offset .cse19)) c_~min3~0) (= .cse20 .cse16) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse20 c_~min3~0)) (not (< .cse20 c_~min2~0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse3)) (.cse22 (select .cse23 c_~A~0.offset)) (.cse24 (* ~M~0 4))) (or (not (< .cse21 .cse22)) (< (select .cse23 (+ c_~A~0.offset .cse24)) c_~min3~0) (= c_~min3~0 .cse21) (not (< .cse22 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse23 (+ c_~A~0.offset .cse24 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0))))) .cse4) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse26 (select .cse27 c_~A~0.offset)) (.cse25 (select .cse27 .cse3))) (or (not (< .cse25 .cse26)) (not (< .cse26 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse29 (select .cse27 (+ c_~A~0.offset .cse28)))) (or (< (select .cse27 (+ c_~A~0.offset .cse28 4)) .cse29) (not (< .cse29 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse29 c_~min2~0)) (= .cse29 .cse25))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse33 (select .cse30 .cse3))) (or (< (select .cse30 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse34 (* ~M~0 4))) (let ((.cse32 (select .cse30 (+ c_~A~0.offset .cse34))) (.cse31 (select .cse30 (+ c_~A~0.offset .cse34 4)))) (or (not (< .cse31 .cse32)) (not (< .cse32 c_~min3~0)) (= .cse31 .cse33) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse31 c_~min2~0)))))) (not (< .cse33 c_~min1~0)))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse36 (select .cse39 c_~A~0.offset)) (.cse35 (select .cse39 .cse3))) (or (not (< .cse35 .cse36)) (not (< .cse36 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse40 (* ~M~0 4))) (let ((.cse38 (select .cse39 (+ c_~A~0.offset .cse40))) (.cse37 (select .cse39 (+ c_~A~0.offset .cse40 4)))) (or (not (< .cse37 .cse38)) (not (< .cse38 c_~min3~0)) (= .cse37 .cse35) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse37 c_~min2~0)))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse43 (select .cse44 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse45 (* ~M~0 4))) (let ((.cse42 (select .cse44 (+ c_~A~0.offset .cse45))) (.cse41 (select .cse44 (+ c_~A~0.offset .cse45 4)))) (or (not (< .cse41 .cse42)) (not (< .cse42 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse43 .cse41) (not (< .cse41 c_~min2~0)))))) (not (< .cse43 c_~min1~0)) (< (select .cse44 .cse3) .cse43))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset))) (or (not (< .cse46 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse48 (* ~M~0 4))) (let ((.cse49 (select .cse47 (+ c_~A~0.offset .cse48)))) (or (< (select .cse47 (+ c_~A~0.offset .cse48 4)) .cse49) (not (< .cse49 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse49 c_~min2~0)) (= .cse46 .cse49))))) (< (select .cse47 .cse3) .cse46))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse51 (* ~M~0 4)) (.cse52 (select .cse50 .cse3))) (or (< (select .cse50 (+ c_~A~0.offset .cse51)) c_~min3~0) (= c_~min3~0 .cse52) (< (select .cse50 c_~A~0.offset) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse50 (+ c_~A~0.offset .cse51 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse52 c_~min1~0)))))) .cse4) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse54 (select .cse53 .cse3))) (or (< (select .cse53 c_~A~0.offset) c_~min1~0) (not (< .cse54 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse55 (* ~M~0 4))) (let ((.cse56 (select .cse53 (+ c_~A~0.offset .cse55)))) (or (< (select .cse53 (+ c_~A~0.offset .cse55 4)) .cse56) (not (< .cse56 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse56 c_~min2~0)) (= .cse56 .cse54))))))))) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse58 (select .cse57 .cse3))) (or (< (select .cse57 c_~A~0.offset) c_~min1~0) (not (< .cse58 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse59 (* ~M~0 4))) (let ((.cse60 (select .cse57 (+ c_~A~0.offset .cse59 4)))) (or (< (select .cse57 (+ c_~A~0.offset .cse59)) c_~min3~0) (= .cse60 .cse58) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse60 c_~min3~0)) (not (< .cse60 c_~min2~0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base)) (.cse62 (* ~M~0 4))) (or (< (select .cse61 (+ c_~A~0.offset .cse62)) c_~min3~0) (< (select .cse61 c_~A~0.offset) c_~min1~0) (< (select .cse61 .cse3) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (select .cse61 (+ c_~A~0.offset .cse62 4)) c_~min3~0) (< (+ 2 ~M~0) c_~N~0)))) (= c_~min1~0 c_~min3~0) .cse4) (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse63 c_~A~0.offset) c_~min1~0) (< (select .cse63 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse64 (* ~M~0 4))) (let ((.cse65 (select .cse63 (+ c_~A~0.offset .cse64 4)))) (or (< (select .cse63 (+ c_~A~0.offset .cse64)) c_~min3~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse65 c_~min3~0)) (not (< .cse65 c_~min2~0)) (= c_~min1~0 .cse65))))))))))) is different from false [2022-11-04 12:10:45,857 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse4 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ c_~A~0.offset 4))) (and (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (* ~M~0 4)) (.cse2 (select .cse0 .cse3))) (or (< (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~min3~0) (= .cse2 c_~min3~0) (< (select .cse0 c_~A~0.offset) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min3~0) (not (< .cse2 c_~min1~0)))))) .cse4) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse5 (select .cse9 c_~A~0.offset)) (.cse6 (select .cse9 .cse3))) (or (not (< .cse5 c_~min1~0)) (not (< .cse6 .cse5)) (forall ((~M~0 Int)) (let ((.cse10 (* ~M~0 4))) (let ((.cse8 (select .cse9 (+ c_~A~0.offset .cse10))) (.cse7 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (or (not (< .cse7 c_~min2~0)) (not (< .cse8 c_~min3~0)) (not (< .cse7 .cse8)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse7 .cse6))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse11 (select .cse14 c_~A~0.offset)) (.cse12 (select .cse14 .cse3))) (or (not (< .cse11 c_~min1~0)) (not (< .cse12 .cse11)) (forall ((~M~0 Int)) (let ((.cse15 (* ~M~0 4))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset .cse15)))) (or (not (< .cse13 c_~min2~0)) (not (< .cse13 c_~min3~0)) (< (select .cse14 (+ c_~A~0.offset .cse15 4)) .cse13) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse13 .cse12))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse19 (select .cse17 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset .cse18)))) (or (not (< .cse16 c_~min2~0)) (not (< .cse16 c_~min3~0)) (< (select .cse17 (+ c_~A~0.offset .cse18 4)) .cse16) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse16 .cse19))))) (< (select .cse17 c_~A~0.offset) c_~min1~0) (not (< .cse19 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse21 (* ~M~0 4)) (.cse22 (select .cse20 c_~A~0.offset))) (or (< (select .cse20 (+ c_~A~0.offset .cse21 4)) c_~min3~0) (not (< .cse22 c_~min1~0)) (= c_~min3~0 .cse22) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse20 (+ c_~A~0.offset .cse21)) c_~min3~0) (< (select .cse20 .cse3) .cse22))))) .cse4) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse27 (select .cse25 .cse3)) (.cse23 (select .cse25 c_~A~0.offset))) (or (not (< .cse23 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse26 (* ~M~0 4))) (let ((.cse24 (select .cse25 (+ c_~A~0.offset .cse26 4)))) (or (not (< .cse24 c_~min2~0)) (not (< .cse24 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse25 (+ c_~A~0.offset .cse26)) c_~min3~0) (= .cse24 .cse27))))) (not (< .cse27 .cse23)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse31 (* ~M~0 4))) (let ((.cse29 (select .cse30 (+ c_~A~0.offset .cse31))) (.cse28 (select .cse30 (+ c_~A~0.offset .cse31 4)))) (or (not (< .cse28 c_~min2~0)) (not (< .cse29 c_~min3~0)) (not (< .cse28 .cse29)) (= c_~min1~0 .cse28) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))))) (< (select .cse30 .cse3) c_~min1~0) (< (select .cse30 c_~A~0.offset) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse32 (select .cse33 c_~A~0.offset))) (or (not (< .cse32 c_~min1~0)) (< (select .cse33 .cse3) .cse32) (forall ((~M~0 Int)) (let ((.cse35 (* ~M~0 4))) (let ((.cse34 (select .cse33 (+ c_~A~0.offset .cse35 4)))) (or (not (< .cse34 c_~min2~0)) (not (< .cse34 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse33 (+ c_~A~0.offset .cse35)) c_~min3~0) (= .cse34 .cse32))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse39 (select .cse36 .cse3))) (or (< (select .cse36 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse40 (* ~M~0 4))) (let ((.cse38 (select .cse36 (+ c_~A~0.offset .cse40))) (.cse37 (select .cse36 (+ c_~A~0.offset .cse40 4)))) (or (not (< .cse37 c_~min2~0)) (not (< .cse38 c_~min3~0)) (not (< .cse37 .cse38)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse37 .cse39))))) (not (< .cse39 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse41 (select .cse43 c_~A~0.offset))) (or (not (< .cse41 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse44 (* ~M~0 4))) (let ((.cse42 (select .cse43 (+ c_~A~0.offset .cse44)))) (or (not (< .cse42 c_~min2~0)) (not (< .cse42 c_~min3~0)) (= .cse42 .cse41) (< (select .cse43 (+ c_~A~0.offset .cse44 4)) .cse42) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))))) (< (select .cse43 .cse3) .cse41))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base)) (.cse46 (* ~M~0 4))) (or (< (select .cse45 (+ c_~A~0.offset .cse46 4)) c_~min3~0) (< (select .cse45 .cse3) c_~min1~0) (< (select .cse45 c_~A~0.offset) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse45 (+ c_~A~0.offset .cse46)) c_~min3~0)))) (= c_~min1~0 c_~min3~0) .cse4) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse50 (select .cse48 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse49 (* ~M~0 4))) (let ((.cse47 (select .cse48 (+ c_~A~0.offset .cse49 4)))) (or (not (< .cse47 c_~min2~0)) (not (< .cse47 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse48 (+ c_~A~0.offset .cse49)) c_~min3~0) (= .cse47 .cse50))))) (< (select .cse48 c_~A~0.offset) c_~min1~0) (not (< .cse50 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse54 (select .cse51 .cse3)) (.cse53 (select .cse51 c_~A~0.offset)) (.cse52 (* ~M~0 4))) (or (< (select .cse51 (+ c_~A~0.offset .cse52 4)) c_~min3~0) (not (< .cse53 c_~min1~0)) (= .cse54 c_~min3~0) (not (< .cse54 .cse53)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse51 (+ c_~A~0.offset .cse52)) c_~min3~0))))) .cse4) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse58 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse55 (select .cse58 c_~A~0.offset))) (or (not (< .cse55 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse59 (* ~M~0 4))) (let ((.cse57 (select .cse58 (+ c_~A~0.offset .cse59))) (.cse56 (select .cse58 (+ c_~A~0.offset .cse59 4)))) (or (not (< .cse56 c_~min2~0)) (not (< .cse57 c_~min3~0)) (not (< .cse56 .cse57)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse56 .cse55))))) (< (select .cse58 .cse3) .cse55))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse60 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse60 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse62 (* ~M~0 4))) (let ((.cse61 (select .cse60 (+ c_~A~0.offset .cse62 4)))) (or (not (< .cse61 c_~min2~0)) (= c_~min1~0 .cse61) (not (< .cse61 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse60 (+ c_~A~0.offset .cse62)) c_~min3~0))))) (< (select .cse60 c_~A~0.offset) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse63 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (or (< (select .cse63 .cse3) c_~min1~0) (< (select .cse63 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse65 (* ~M~0 4))) (let ((.cse64 (select .cse63 (+ c_~A~0.offset .cse65)))) (or (= c_~min1~0 .cse64) (not (< .cse64 c_~min2~0)) (not (< .cse64 c_~min3~0)) (< (select .cse63 (+ c_~A~0.offset .cse65 4)) .cse64) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0))))))))))) is different from false [2022-11-04 12:10:51,792 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse12 (not (< c_~min3~0 c_~min2~0))) (.cse4 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4))) (and (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse0 (select .cse2 .cse4))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse3 (* ~M~0 4))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3 4)))) (or (not (< .cse1 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse0 .cse1) (< (+ 2 ~M~0) c_~N~0) (< (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3)) c_~min3~0) (not (< .cse1 c_~min2~0)))))) (< (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse5 c_~min1~0)) (< (select .cse6 .cse4) .cse5) (forall ((~M~0 Int)) (let ((.cse7 (* ~M~0 4))) (let ((.cse8 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse7)))) (or (< (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse7 4)) .cse8) (not (< .cse8 c_~min3~0)) (= .cse5 .cse8) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse8 c_~min2~0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse11 (select .cse9 .cse4)) (.cse10 (* ~M~0 4))) (or (< (select .cse9 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse10 4)) c_~min3~0) (not (< .cse11 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse11 c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse9 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse10)) c_~min3~0) (< (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) .cse12) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse13 c_~min1~0)) (< (select .cse14 .cse4) .cse13) (forall ((~M~0 Int)) (let ((.cse16 (* ~M~0 4))) (let ((.cse15 (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16 4)))) (or (not (< .cse15 c_~min3~0)) (= .cse15 .cse13) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16)) c_~min3~0) (not (< .cse15 c_~min2~0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse20 (select .cse18 .cse4)) (.cse19 (* ~M~0 4))) (or (not (< .cse17 c_~min1~0)) (< (select .cse18 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse19 4)) c_~min3~0) (not (< .cse20 .cse17)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse20 c_~min3~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse18 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse19)) c_~min3~0))))) .cse12) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse25 (select .cse22 .cse4)) (.cse21 (select .cse22 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse21 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse24 (select .cse22 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse23)))) (or (< (select .cse22 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse23 4)) .cse24) (not (< .cse24 c_~min3~0)) (= .cse25 .cse24) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse24 c_~min2~0)))))) (not (< .cse25 .cse21)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse26 .cse4) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse27 (select .cse26 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28 4)))) (or (not (< .cse27 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse26 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28)) c_~min3~0) (not (< .cse27 c_~min2~0)) (= c_~min1~0 .cse27))))) (< (select .cse26 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse29 (select .cse32 .cse4))) (or (not (< .cse29 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse33 (* ~M~0 4))) (let ((.cse31 (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33))) (.cse30 (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33 4)))) (or (not (< .cse30 .cse31)) (not (< .cse31 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse29 .cse30) (< (+ 2 ~M~0) c_~N~0) (not (< .cse30 c_~min2~0)))))) (< (select .cse32 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse34 c_~min1~0)) (< (select .cse35 .cse4) .cse34) (forall ((~M~0 Int)) (let ((.cse38 (* ~M~0 4))) (let ((.cse37 (select .cse35 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse38))) (.cse36 (select .cse35 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse38 4)))) (or (not (< .cse36 .cse37)) (= .cse36 .cse34) (not (< .cse37 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse36 c_~min2~0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse41 (* ~M~0 4))) (or (not (< .cse39 c_~min1~0)) (= .cse39 c_~min3~0) (< (select .cse40 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse41 4)) c_~min3~0) (< (select .cse40 .cse4) .cse39) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse40 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse41)) c_~min3~0))))) .cse12) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse43 (* ~M~0 4)) (.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse42 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse43 4)) c_~min3~0) (< (select .cse42 .cse4) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse42 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse43)) c_~min3~0) (< (select .cse42 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (= c_~min1~0 c_~min3~0) .cse12) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse47 (select .cse44 .cse4))) (or (forall ((~M~0 Int)) (let ((.cse45 (* ~M~0 4))) (let ((.cse46 (select .cse44 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse45)))) (or (< (select .cse44 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse45 4)) .cse46) (not (< .cse46 c_~min3~0)) (= .cse47 .cse46) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse46 c_~min2~0)))))) (not (< .cse47 c_~min1~0)) (< (select .cse44 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse49 (select .cse50 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse51))) (.cse48 (select .cse50 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse51 4)))) (or (not (< .cse48 .cse49)) (not (< .cse49 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min2~0)) (= c_~min1~0 .cse48))))) (< (select .cse50 .cse4) c_~min1~0) (< (select .cse50 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse52 (select .cse55 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse53 (select .cse55 .cse4))) (or (not (< .cse52 c_~min1~0)) (not (< .cse53 .cse52)) (forall ((~M~0 Int)) (let ((.cse56 (* ~M~0 4))) (let ((.cse54 (select .cse55 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse56 4)))) (or (not (< .cse54 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse53 .cse54) (< (+ 2 ~M~0) c_~N~0) (< (select .cse55 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse56)) c_~min3~0) (not (< .cse54 c_~min2~0)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse57 (select .cse61 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse58 (select .cse61 .cse4))) (or (not (< .cse57 c_~min1~0)) (not (< .cse58 .cse57)) (forall ((~M~0 Int)) (let ((.cse62 (* ~M~0 4))) (let ((.cse60 (select .cse61 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse62))) (.cse59 (select .cse61 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse62 4)))) (or (not (< .cse59 .cse60)) (not (< .cse60 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (= .cse58 .cse59) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min2~0)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse63 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse63 .cse4) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse64 (* ~M~0 4))) (let ((.cse65 (select .cse63 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse64)))) (or (< (select .cse63 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse64 4)) .cse65) (not (< .cse65 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse65) (not (< .cse65 c_~min2~0)))))) (< (select .cse63 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))))) (not (< 1 c_~N~0))) is different from false [2022-11-04 12:10:52,985 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse3 (not (< c_~min3~0 c_~min2~0))) (.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (or (= c_~min1~0 c_~min3~0) (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (* ~M~0 4)) (.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse0 .cse2) c_~min1~0)))) .cse3) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse4 .cse2) .cse5) (not (< .cse5 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse8 (* ~M~0 4))) (let ((.cse6 (select .cse4 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse7 (select .cse4 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse6 c_~min2~0)) (not (< .cse7 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse6 .cse5) (not (< .cse6 .cse7)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse9 .cse2) .cse10) (not (< .cse10 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse11 (* ~M~0 4))) (let ((.cse12 (select .cse9 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse9 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse12) (= .cse12 .cse10) (not (< .cse12 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse12 c_~min2~0)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse14 (* ~M~0 4))) (let ((.cse15 (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse15) (= c_~min1~0 .cse15) (not (< .cse15 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse15 c_~min2~0)))))) (< (select .cse13 .cse2) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse16 .cse2)) (.cse18 (* ~M~0 4))) (or (< (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< .cse17 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse16 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (= .cse17 c_~min3~0) (< (select .cse16 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) .cse3) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse19 .cse2))) (or (< (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< .cse20 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse21 (select .cse19 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse22 (select .cse19 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse21 c_~min2~0)) (= .cse20 .cse21) (not (< .cse22 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse21 .cse22)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse26 (* ~M~0 4))) (let ((.cse25 (select .cse24 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse25 c_~min2~0)) (= c_~min1~0 .cse25) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse25 c_~min3~0)) (< (select .cse24 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (< (select .cse24 .cse2) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse27 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse28 (select .cse31 .cse2))) (or (not (< .cse27 c_~min1~0)) (not (< .cse28 .cse27)) (forall ((~M~0 Int)) (let ((.cse32 (* ~M~0 4))) (let ((.cse29 (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse30 (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse29 c_~min2~0)) (= .cse28 .cse29) (not (< .cse30 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse29 .cse30)))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse33 .cse2) .cse34) (forall ((~M~0 Int)) (let ((.cse36 (* ~M~0 4))) (let ((.cse35 (select .cse33 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse35 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse35 .cse34) (not (< .cse35 c_~min3~0)) (< (select .cse33 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (not (< .cse34 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse38 (select .cse39 .cse2)) (.cse41 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse40 (* ~M~0 4))) (let ((.cse37 (select .cse39 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse37 c_~min2~0)) (= .cse38 .cse37) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse37 c_~min3~0)) (< (select .cse39 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (not (< .cse41 c_~min1~0)) (not (< .cse38 .cse41)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse45 (select .cse43 .cse2)) (.cse44 (* ~M~0 4))) (or (not (< .cse42 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse43 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (not (< .cse45 .cse42)) (= .cse45 c_~min3~0) (< (select .cse43 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) .cse3) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse49 (select .cse46 .cse2))) (or (< (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse47 (* ~M~0 4))) (let ((.cse48 (select .cse46 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse46 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse48) (= .cse48 .cse49) (not (< .cse48 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min2~0)))))) (not (< .cse49 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse52 (* ~M~0 4))) (or (< (select .cse50 .cse2) .cse51) (= c_~min3~0 .cse51) (not (< .cse51 c_~min1~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse50 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (< (select .cse50 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) .cse3) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse56 (* ~M~0 4))) (let ((.cse53 (select .cse55 (+ .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse54 (select .cse55 (+ .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse53 c_~min2~0)) (= c_~min1~0 .cse53) (not (< .cse54 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse53 .cse54)))))) (< (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select .cse55 .cse2) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse60 (select .cse57 .cse2)) (.cse61 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse58 (* ~M~0 4))) (let ((.cse59 (select .cse57 (+ .cse58 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse57 (+ .cse58 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse59) (= .cse59 .cse60) (not (< .cse59 c_~min3~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min2~0)))))) (not (< .cse61 c_~min1~0)) (not (< .cse60 .cse61)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse62 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse64 (select .cse62 .cse2))) (or (< (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse65 (* ~M~0 4))) (let ((.cse63 (select .cse62 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse63 c_~min2~0)) (= .cse64 .cse63) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse63 c_~min3~0)) (< (select .cse62 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (not (< .cse64 c_~min1~0))))))))) is different from false [2022-11-04 12:10:53,619 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (let ((.cse7 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse1 (* ~M~0 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse2) (not (< .cse2 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min3~0)) (= c_~min1~0 .cse2))))) (< (select .cse0 .cse3) c_~min1~0) (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (* ~M~0 4))) (or (< (select .cse4 .cse3) .cse5) (= c_~min3~0 .cse5) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min1~0)) (< (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 .cse3)) (.cse10 (* ~M~0 4))) (or (= .cse8 c_~min3~0) (< (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse8 c_~min1~0)) (< (select .cse9 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse3)) (.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (* ~M~0 4))) (or (= .cse11 c_~min3~0) (not (< .cse11 .cse12)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse12 c_~min1~0)) (< (select .cse13 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse19 .cse3)) (.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 .cse16)) (forall ((~M~0 Int)) (let ((.cse20 (* ~M~0 4))) (let ((.cse18 (select .cse19 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse17 (select .cse19 (+ .cse20 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse17 .cse18)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse18 c_~min3~0)) (not (< .cse17 c_~min2~0)) (= .cse15 .cse17))))) (not (< .cse16 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse21 .cse3) .cse22) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse24 (select .cse21 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse21 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse24) (= .cse22 .cse24) (not (< .cse24 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse24 c_~min3~0)))))) (not (< .cse22 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse26 (select .cse27 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse25 .cse26) (< (select .cse27 (+ .cse28 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse26) (not (< .cse26 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse26 c_~min3~0)))))) (< (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse25 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse29 .cse3) .cse30) (forall ((~M~0 Int)) (let ((.cse32 (* ~M~0 4))) (let ((.cse31 (select .cse29 (+ .cse32 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse31 c_~min3~0)) (= .cse31 .cse30) (not (< .cse31 c_~min2~0)) (< (select .cse29 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse30 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (or (< (select .cse33 .cse3) c_~min1~0) (< (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))) (= c_~min1~0 c_~min3~0) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse37 (* ~M~0 4))) (let ((.cse35 (select .cse36 (+ .cse37 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse35) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse35 c_~min3~0)) (not (< .cse35 c_~min2~0)) (< (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse36 .cse3) c_~min1~0) (< (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse40 .cse3)) (.cse42 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse41 (* ~M~0 4))) (let ((.cse39 (select .cse40 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse38 .cse39) (< (select .cse40 (+ .cse41 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse39) (not (< .cse39 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse39 c_~min3~0)))))) (not (< .cse38 .cse42)) (not (< .cse42 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse45 .cse3)) (.cse47 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse46 (* ~M~0 4))) (let ((.cse43 (select .cse45 (+ .cse46 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse43 c_~min3~0)) (not (< .cse43 c_~min2~0)) (= .cse44 .cse43) (< (select .cse45 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse44 .cse47)) (not (< .cse47 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse50 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse48 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min3~0)) (not (< .cse48 c_~min2~0)) (= .cse49 .cse48) (< (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse49 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse52 .cse3) .cse53) (forall ((~M~0 Int)) (let ((.cse56 (* ~M~0 4))) (let ((.cse55 (select .cse52 (+ .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse54 (select .cse52 (+ .cse56 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse54 .cse55)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse55 c_~min3~0)) (= .cse54 .cse53) (not (< .cse54 c_~min2~0)))))) (not (< .cse53 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse57 .cse3) c_~min1~0) (< (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse60 (* ~M~0 4))) (let ((.cse59 (select .cse57 (+ .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse58 (select .cse57 (+ .cse60 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse58) (not (< .cse58 .cse59)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min3~0)) (not (< .cse58 c_~min2~0))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse62 (select .cse61 .cse3))) (or (< (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse62 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse65 (* ~M~0 4))) (let ((.cse64 (select .cse61 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse63 (select .cse61 (+ .cse65 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse63 .cse64)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 c_~min3~0)) (not (< .cse63 c_~min2~0)) (= .cse62 .cse63)))))))))))) is different from false [2022-11-04 12:10:58,322 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 1 c_~N~0)) (let ((.cse7 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse1 (* ~M~0 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse2) (not (< .cse2 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min3~0)) (= c_~min1~0 .cse2))))) (< (select .cse0 .cse3) c_~min1~0) (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (* ~M~0 4))) (or (< (select .cse4 .cse3) .cse5) (= c_~min3~0 .cse5) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min1~0)) (< (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 .cse3)) (.cse10 (* ~M~0 4))) (or (= .cse8 c_~min3~0) (< (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse8 c_~min1~0)) (< (select .cse9 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse3)) (.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (* ~M~0 4))) (or (= .cse11 c_~min3~0) (not (< .cse11 .cse12)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse12 c_~min1~0)) (< (select .cse13 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse19 .cse3)) (.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 .cse16)) (forall ((~M~0 Int)) (let ((.cse20 (* ~M~0 4))) (let ((.cse18 (select .cse19 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse17 (select .cse19 (+ .cse20 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse17 .cse18)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse18 c_~min3~0)) (not (< .cse17 c_~min2~0)) (= .cse15 .cse17))))) (not (< .cse16 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse21 .cse3) .cse22) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse24 (select .cse21 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse21 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse24) (= .cse22 .cse24) (not (< .cse24 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse24 c_~min3~0)))))) (not (< .cse22 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse26 (select .cse27 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse25 .cse26) (< (select .cse27 (+ .cse28 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse26) (not (< .cse26 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse26 c_~min3~0)))))) (< (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse25 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse29 .cse3) .cse30) (forall ((~M~0 Int)) (let ((.cse32 (* ~M~0 4))) (let ((.cse31 (select .cse29 (+ .cse32 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse31 c_~min3~0)) (= .cse31 .cse30) (not (< .cse31 c_~min2~0)) (< (select .cse29 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse30 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (or (< (select .cse33 .cse3) c_~min1~0) (< (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))) (= c_~min1~0 c_~min3~0) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse37 (* ~M~0 4))) (let ((.cse35 (select .cse36 (+ .cse37 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse35) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse35 c_~min3~0)) (not (< .cse35 c_~min2~0)) (< (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse36 .cse3) c_~min1~0) (< (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse40 .cse3)) (.cse42 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse41 (* ~M~0 4))) (let ((.cse39 (select .cse40 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse38 .cse39) (< (select .cse40 (+ .cse41 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse39) (not (< .cse39 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse39 c_~min3~0)))))) (not (< .cse38 .cse42)) (not (< .cse42 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse45 .cse3)) (.cse47 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse46 (* ~M~0 4))) (let ((.cse43 (select .cse45 (+ .cse46 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse43 c_~min3~0)) (not (< .cse43 c_~min2~0)) (= .cse44 .cse43) (< (select .cse45 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse44 .cse47)) (not (< .cse47 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse50 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse48 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min3~0)) (not (< .cse48 c_~min2~0)) (= .cse49 .cse48) (< (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse49 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse52 .cse3) .cse53) (forall ((~M~0 Int)) (let ((.cse56 (* ~M~0 4))) (let ((.cse55 (select .cse52 (+ .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse54 (select .cse52 (+ .cse56 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse54 .cse55)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse55 c_~min3~0)) (= .cse54 .cse53) (not (< .cse54 c_~min2~0)))))) (not (< .cse53 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse57 .cse3) c_~min1~0) (< (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse60 (* ~M~0 4))) (let ((.cse59 (select .cse57 (+ .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse58 (select .cse57 (+ .cse60 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse58) (not (< .cse58 .cse59)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min3~0)) (not (< .cse58 c_~min2~0))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse62 (select .cse61 .cse3))) (or (< (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse62 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse65 (* ~M~0 4))) (let ((.cse64 (select .cse61 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse63 (select .cse61 (+ .cse65 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse63 .cse64)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 c_~min3~0)) (not (< .cse63 c_~min2~0)) (= .cse62 .cse63)))))))))))) is different from false [2022-11-04 12:10:59,020 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse7 (not (< c_~min3~0 c_~min2~0))) (.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse1 (* ~M~0 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse2) (not (< .cse2 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min3~0)) (= c_~min1~0 .cse2))))) (< (select .cse0 .cse3) c_~min1~0) (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (* ~M~0 4))) (or (< (select .cse4 .cse3) .cse5) (= c_~min3~0 .cse5) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min1~0)) (< (select .cse4 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 .cse3)) (.cse10 (* ~M~0 4))) (or (= .cse8 c_~min3~0) (< (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse8 c_~min1~0)) (< (select .cse9 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse3)) (.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (* ~M~0 4))) (or (= .cse11 c_~min3~0) (not (< .cse11 .cse12)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse12 c_~min1~0)) (< (select .cse13 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse13 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse19 .cse3)) (.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 .cse16)) (forall ((~M~0 Int)) (let ((.cse20 (* ~M~0 4))) (let ((.cse18 (select .cse19 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse17 (select .cse19 (+ .cse20 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse17 .cse18)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse18 c_~min3~0)) (not (< .cse17 c_~min2~0)) (= .cse15 .cse17))))) (not (< .cse16 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse21 .cse3) .cse22) (forall ((~M~0 Int)) (let ((.cse23 (* ~M~0 4))) (let ((.cse24 (select .cse21 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse21 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse24) (= .cse22 .cse24) (not (< .cse24 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse24 c_~min3~0)))))) (not (< .cse22 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse26 (select .cse27 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse25 .cse26) (< (select .cse27 (+ .cse28 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse26) (not (< .cse26 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse26 c_~min3~0)))))) (< (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse25 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse29 .cse3) .cse30) (forall ((~M~0 Int)) (let ((.cse32 (* ~M~0 4))) (let ((.cse31 (select .cse29 (+ .cse32 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse31 c_~min3~0)) (= .cse31 .cse30) (not (< .cse31 c_~min2~0)) (< (select .cse29 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse30 c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (or (< (select .cse33 .cse3) c_~min1~0) (< (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (< (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))) (= c_~min1~0 c_~min3~0) .cse7) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int)) (let ((.cse37 (* ~M~0 4))) (let ((.cse35 (select .cse36 (+ .cse37 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse35) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse35 c_~min3~0)) (not (< .cse35 c_~min2~0)) (< (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse36 .cse3) c_~min1~0) (< (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse40 .cse3)) (.cse42 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse41 (* ~M~0 4))) (let ((.cse39 (select .cse40 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse38 .cse39) (< (select .cse40 (+ .cse41 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse39) (not (< .cse39 c_~min2~0)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse39 c_~min3~0)))))) (not (< .cse38 .cse42)) (not (< .cse42 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse45 .cse3)) (.cse47 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse46 (* ~M~0 4))) (let ((.cse43 (select .cse45 (+ .cse46 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse43 c_~min3~0)) (not (< .cse43 c_~min2~0)) (= .cse44 .cse43) (< (select .cse45 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse44 .cse47)) (not (< .cse47 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse50 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse48 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse48 c_~min3~0)) (not (< .cse48 c_~min2~0)) (= .cse49 .cse48) (< (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse49 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse52 .cse3) .cse53) (forall ((~M~0 Int)) (let ((.cse56 (* ~M~0 4))) (let ((.cse55 (select .cse52 (+ .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse54 (select .cse52 (+ .cse56 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse54 .cse55)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse55 c_~min3~0)) (= .cse54 .cse53) (not (< .cse54 c_~min2~0)))))) (not (< .cse53 c_~min1~0)))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse57 .cse3) c_~min1~0) (< (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse60 (* ~M~0 4))) (let ((.cse59 (select .cse57 (+ .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse58 (select .cse57 (+ .cse60 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse58) (not (< .cse58 .cse59)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse59 c_~min3~0)) (not (< .cse58 c_~min2~0))))))))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse61 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse62 (select .cse61 .cse3))) (or (< (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse62 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse65 (* ~M~0 4))) (let ((.cse64 (select .cse61 (+ .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse63 (select .cse61 (+ .cse65 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse63 .cse64)) (not (< (+ ~M~0 1) c_~N~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse64 c_~min3~0)) (not (< .cse63 c_~min2~0)) (= .cse62 .cse63)))))))))))) is different from false [2022-11-04 12:10:59,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:10:59,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 118 [2022-11-04 12:10:59,889 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:10:59,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2843 treesize of output 2733 [2022-11-04 12:10:59,972 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:10:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2703 treesize of output 2365 [2022-11-04 12:11:00,048 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:00,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2335 treesize of output 2181 [2022-11-04 12:11:00,129 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:00,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1343 treesize of output 1281 [2022-11-04 12:11:04,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:11:04,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 132 [2022-11-04 12:11:04,668 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:04,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3601 treesize of output 3451 [2022-11-04 12:11:04,752 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:04,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3421 treesize of output 3187 [2022-11-04 12:11:04,844 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:04,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3157 treesize of output 3055 [2022-11-04 12:11:04,959 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-11-04 12:11:04,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3025 treesize of output 2527 [2022-11-04 12:11:22,160 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 1 [2022-11-04 12:11:22,176 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2022-11-04 12:11:22,190 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 1 [2022-11-04 12:11:22,206 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2022-11-04 12:11:22,223 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 1 [2022-11-04 12:11:22,235 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 1 [2022-11-04 12:11:22,248 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 1 [2022-11-04 12:11:22,260 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 1 [2022-11-04 12:11:22,272 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2022-11-04 12:11:22,286 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2022-11-04 12:11:22,297 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 1 [2022-11-04 12:11:22,309 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:22,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 1 [2022-11-04 12:11:22,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:11:22,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-11-04 12:11:22,359 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:11:22,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2261 treesize of output 2161 [2022-11-04 12:11:22,422 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:11:22,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2153 treesize of output 1857 [2022-11-04 12:11:22,487 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:11:22,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1849 treesize of output 1705 [2022-11-04 12:11:22,546 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:11:22,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 889 treesize of output 821 [2022-11-04 12:11:24,413 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:11:24,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 1 [2022-11-04 12:11:26,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-04 12:11:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-04 12:11:26,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473243544] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:11:26,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:11:26,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 41] total 111 [2022-11-04 12:11:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003132669] [2022-11-04 12:11:26,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:11:26,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-04 12:11:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:11:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-04 12:11:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=9429, Unknown=38, NotChecked=1872, Total=12210 [2022-11-04 12:11:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:11:26,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:11:26,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.4864864864864864) internal successors, (387), 111 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:11:26,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-04 12:11:26,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-04 12:13:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-11-04 12:13:09,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-04 12:13:09,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-04 12:13:09,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:13:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:13:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1184091940, now seen corresponding path program 6 times [2022-11-04 12:13:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:13:09,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632645558] [2022-11-04 12:13:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:13:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:13:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632645558] [2022-11-04 12:13:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632645558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:13:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531381238] [2022-11-04 12:13:09,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-04 12:13:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:13:09,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:13:09,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-04 12:13:09,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-04 12:13:09,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:13:09,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-04 12:13:09,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:13:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:10,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:13:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:10,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531381238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:13:10,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:13:10,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-04 12:13:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655107891] [2022-11-04 12:13:10,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:13:10,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-04 12:13:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:13:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-04 12:13:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-04 12:13:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:10,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:13:10,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.735294117647059) internal successors, (263), 34 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2022-11-04 12:13:10,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-11-04 12:13:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:33,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-04 12:13:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:33,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:13:33,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:13:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 47260149, now seen corresponding path program 2 times [2022-11-04 12:13:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:13:33,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091903002] [2022-11-04 12:13:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:13:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:13:33,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091903002] [2022-11-04 12:13:33,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091903002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:13:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847539114] [2022-11-04 12:13:33,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:13:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:13:33,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:13:33,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-04 12:13:33,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:13:33,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:13:33,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-04 12:13:33,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:13:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:34,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:13:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:34,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847539114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:13:34,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:13:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-04 12:13:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740485995] [2022-11-04 12:13:34,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:13:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-04 12:13:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:13:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-04 12:13:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-04 12:13:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:34,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:13:34,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.333333333333334) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 167 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:34,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:13:39,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-04 12:13:39,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:39,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:13:39,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:13:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash -560251738, now seen corresponding path program 1 times [2022-11-04 12:13:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:13:39,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340999907] [2022-11-04 12:13:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:13:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:39,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:13:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340999907] [2022-11-04 12:13:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340999907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:13:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820198703] [2022-11-04 12:13:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:39,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:13:39,569 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:13:39,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-04 12:13:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:39,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-04 12:13:39,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:13:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:39,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:13:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820198703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:13:40,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:13:40,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-11-04 12:13:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163102507] [2022-11-04 12:13:40,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:13:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-04 12:13:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:13:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-04 12:13:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-11-04 12:13:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:40,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:13:40,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:13:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:13:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:13:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-04 12:13:41,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-04 12:13:41,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:41,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:13:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:13:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2129559851, now seen corresponding path program 2 times [2022-11-04 12:13:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:13:41,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026425007] [2022-11-04 12:13:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:13:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-04 12:13:42,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:13:42,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026425007] [2022-11-04 12:13:42,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026425007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:13:42,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614610376] [2022-11-04 12:13:42,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:13:42,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:13:42,242 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:13:42,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-04 12:13:42,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:13:42,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:13:42,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-04 12:13:42,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:13:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-04 12:13:42,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-04 12:13:42,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614610376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:13:42,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-04 12:13:42,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-11-04 12:13:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756554347] [2022-11-04 12:13:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:13:42,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:13:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:13:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:13:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-04 12:13:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:42,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:13:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:13:42,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:42,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:42,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:42,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-04 12:13:42,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:13:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-04 12:13:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:13:50,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-04 12:13:50,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-04 12:13:50,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:13:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:13:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 417512077, now seen corresponding path program 1 times [2022-11-04 12:13:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:13:50,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435816642] [2022-11-04 12:13:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:13:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:13:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435816642] [2022-11-04 12:13:52,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435816642] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:13:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464288592] [2022-11-04 12:13:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:13:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:13:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:13:52,728 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:13:52,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-04 12:13:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:13:52,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-04 12:13:52,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:13:54,987 INFO L356 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-04 12:13:54,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 120 [2022-11-04 12:13:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:13:56,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:13:58,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:13:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 373 treesize of output 193 [2022-11-04 12:14:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:14:03,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464288592] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:14:03,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:14:03,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 28] total 70 [2022-11-04 12:14:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838154081] [2022-11-04 12:14:03,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:14:03,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-04 12:14:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:14:03,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-04 12:14:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=4255, Unknown=0, NotChecked=0, Total=4830 [2022-11-04 12:14:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:03,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:14:03,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.314285714285714) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:03,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:03,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-11-04 12:14:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:14:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:14:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-04 12:14:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-11-04 12:14:33,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-04 12:14:33,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-04 12:14:33,625 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:14:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:14:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -190132009, now seen corresponding path program 1 times [2022-11-04 12:14:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:14:33,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171325383] [2022-11-04 12:14:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:14:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:14:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:14:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:14:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:14:36,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171325383] [2022-11-04 12:14:36,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171325383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:14:36,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261020005] [2022-11-04 12:14:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:14:36,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:14:36,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:14:36,332 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:14:36,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-04 12:14:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:14:36,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-04 12:14:36,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:14:38,541 INFO L356 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-11-04 12:14:38,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 146 treesize of output 120 [2022-11-04 12:14:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:14:39,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:14:41,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:14:41,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 279 treesize of output 169 [2022-11-04 12:14:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:14:45,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261020005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:14:45,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:14:45,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 28, 28] total 74 [2022-11-04 12:14:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093041905] [2022-11-04 12:14:45,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:14:45,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-04 12:14:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:14:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-04 12:14:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=4756, Unknown=0, NotChecked=0, Total=5402 [2022-11-04 12:14:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:45,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:14:45,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.581081081081081) internal successors, (339), 74 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:14:45,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:14:45,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 183 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-04 12:14:45,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:14:45,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-11-04 12:14:45,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:15:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:15:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-11-04 12:15:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-11-04 12:15:45,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-04 12:15:45,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-04 12:15:45,987 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:15:45,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:15:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash 51149460, now seen corresponding path program 2 times [2022-11-04 12:15:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:15:45,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324233002] [2022-11-04 12:15:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:15:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:15:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:15:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:15:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:15:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324233002] [2022-11-04 12:15:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324233002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:15:46,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52209453] [2022-11-04 12:15:46,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:15:46,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:15:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:15:46,299 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:15:46,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-04 12:15:46,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:15:46,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:15:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-04 12:15:46,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:15:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-04 12:15:46,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:15:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-04 12:15:47,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52209453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:15:47,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:15:47,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-04 12:15:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496742771] [2022-11-04 12:15:47,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:15:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-04 12:15:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:15:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-04 12:15:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2022-11-04 12:15:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:15:47,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:15:47,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.722222222222222) internal successors, (278), 36 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:15:47,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:15:47,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:15:47,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:15:47,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 198 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:15:47,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-11-04 12:15:47,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2022-11-04 12:15:47,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:18:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:18:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-11-04 12:18:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-11-04 12:18:01,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-04 12:18:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:18:01,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:18:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:18:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash -732142972, now seen corresponding path program 7 times [2022-11-04 12:18:01,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:18:01,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347247593] [2022-11-04 12:18:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:18:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:18:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:18:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:18:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:18:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347247593] [2022-11-04 12:18:01,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347247593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:18:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96284733] [2022-11-04 12:18:01,569 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-04 12:18:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:18:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:18:01,570 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:18:01,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-04 12:18:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:18:01,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-04 12:18:01,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:18:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:18:01,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:18:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:18:02,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96284733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:18:02,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:18:02,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2022-11-04 12:18:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398625027] [2022-11-04 12:18:02,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:18:02,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-04 12:18:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:18:02,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-04 12:18:02,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-11-04 12:18:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:02,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:18:02,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 27 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:18:02,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 285 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 195 states. [2022-11-04 12:18:02,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:18:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:18:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-11-04 12:18:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-11-04 12:18:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-04 12:18:05,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-04 12:18:05,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:18:05,747 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-04 12:18:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:18:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash -885288593, now seen corresponding path program 8 times [2022-11-04 12:18:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:18:05,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69496550] [2022-11-04 12:18:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:18:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:18:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:18:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:18:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:18:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69496550] [2022-11-04 12:18:09,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69496550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:18:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848320912] [2022-11-04 12:18:09,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:18:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:18:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:18:09,156 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:18:09,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3e0f163-33bd-4ab1-b2ef-de90b1e09d33/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-04 12:18:09,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:18:09,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:18:09,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-04 12:18:09,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:18:10,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-04 12:18:10,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:18:11,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-04 12:18:12,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:18:12,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2022-11-04 12:18:14,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:18:14,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:18:14,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 108 [2022-11-04 12:18:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:18:15,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:18:45,115 WARN L234 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:18:52,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse99 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse26 (not (< c_~min3~0 c_~min2~0))) (.cse7 (+ c_~A~0.offset .cse99 4)) (.cse8 (+ c_~A~0.offset .cse99))) (and (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse6 (select .cse5 c_~A~0.base))) (let ((.cse0 (select .cse6 .cse8)) (.cse1 (select .cse6 .cse7))) (or (not (< .cse0 c_~min1~0)) (not (< .cse1 .cse0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse4 (* ~M~0 4))) (let ((.cse2 (select .cse3 (+ c_~A~0.offset .cse4)))) (or (not (< .cse2 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse3 (+ c_~A~0.offset .cse4 4)) .cse2) (not (< .cse2 c_~min3~0)) (= .cse1 .cse2)))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse13 (select .cse12 c_~A~0.base))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse10 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (or (not (< .cse9 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse10 (+ c_~A~0.offset .cse11)) c_~min3~0) (= c_~min1~0 .cse9) (not (< .cse9 c_~min3~0)) (< 0 ~M~0))))) (< (select .cse13 .cse8) c_~min1~0) (< (select .cse13 .cse7) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse15 (select .cse19 c_~A~0.base))) (let ((.cse14 (select .cse15 .cse7))) (or (not (< .cse14 c_~min1~0)) (< (select .cse15 .cse8) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset .cse18)))) (or (not (< .cse16 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse17 (+ c_~A~0.offset .cse18 4)) .cse16) (not (< .cse16 c_~min3~0)) (= .cse14 .cse16)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse25 (select .cse24 c_~A~0.base))) (let ((.cse21 (select .cse25 .cse7)) (.cse20 (select .cse25 .cse8)) (.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse23 (* ~M~0 4))) (or (not (< .cse20 c_~min1~0)) (= .cse21 c_~min3~0) (not (< .cse21 .cse20)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse22 (+ c_~A~0.offset .cse23)) c_~min3~0) (< 0 ~M~0) (< (select .cse22 (+ c_~A~0.offset .cse23 4)) c_~min3~0)))))) .cse26) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse27 (select .cse31 c_~A~0.base))) (let ((.cse28 (select .cse27 .cse8)) (.cse29 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse30 (* ~M~0 4))) (or (< (select .cse27 .cse7) .cse28) (not (< .cse28 c_~min1~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse29 (+ c_~A~0.offset .cse30)) c_~min3~0) (< 0 ~M~0) (= .cse28 c_~min3~0) (< (select .cse29 (+ c_~A~0.offset .cse30 4)) c_~min3~0)))))) .cse26) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse32 (select .cse36 c_~A~0.base))) (or (< (select .cse32 .cse8) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse35 (* ~M~0 4))) (let ((.cse33 (select .cse34 (+ c_~A~0.offset .cse35)))) (or (not (< .cse33 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= c_~min1~0 .cse33) (< (select .cse34 (+ c_~A~0.offset .cse35 4)) .cse33) (not (< .cse33 c_~min3~0)))))) (< (select .cse32 .cse7) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse42 (select .cse41 c_~A~0.base))) (let ((.cse40 (select .cse42 .cse7))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse38 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse39 (* ~M~0 4))) (let ((.cse37 (select .cse38 (+ c_~A~0.offset .cse39 4)))) (or (not (< .cse37 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse38 (+ c_~A~0.offset .cse39)) c_~min3~0) (not (< .cse37 c_~min3~0)) (< 0 ~M~0) (= .cse40 .cse37))))) (not (< .cse40 c_~min1~0)) (< (select .cse42 .cse8) c_~min1~0)))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse43 (select .cse48 c_~A~0.base))) (let ((.cse44 (select .cse43 .cse8))) (or (< (select .cse43 .cse7) .cse44) (not (< .cse44 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse46 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse47 (* ~M~0 4))) (let ((.cse45 (select .cse46 (+ c_~A~0.offset .cse47)))) (or (not (< .cse45 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse46 (+ c_~A~0.offset .cse47 4)) .cse45) (not (< .cse45 c_~min3~0)) (= .cse44 .cse45)))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse55 (select .cse54 c_~A~0.base))) (let ((.cse49 (select .cse55 .cse8)) (.cse50 (select .cse55 .cse7))) (or (not (< .cse49 c_~min1~0)) (not (< .cse50 .cse49)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse52 (select (store .cse54 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse53 (* ~M~0 4))) (let ((.cse51 (select .cse52 (+ c_~A~0.offset .cse53 4)))) (or (not (< .cse51 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse52 (+ c_~A~0.offset .cse53)) c_~min3~0) (not (< .cse51 c_~min3~0)) (< 0 ~M~0) (= .cse50 .cse51)))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse57 (select .cse62 c_~A~0.base))) (let ((.cse56 (select .cse57 .cse7))) (or (not (< .cse56 c_~min1~0)) (< (select .cse57 .cse8) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse60 (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse61 (* ~M~0 4))) (let ((.cse58 (select .cse60 (+ c_~A~0.offset .cse61 4))) (.cse59 (select .cse60 (+ c_~A~0.offset .cse61)))) (or (not (< .cse58 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse56 .cse58) (not (< .cse59 c_~min3~0)) (not (< .cse58 .cse59))))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse68 (select .cse67 c_~A~0.base))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse65 (select (store .cse67 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse66 (* ~M~0 4))) (let ((.cse63 (select .cse65 (+ c_~A~0.offset .cse66 4))) (.cse64 (select .cse65 (+ c_~A~0.offset .cse66)))) (or (not (< .cse63 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (= c_~min1~0 .cse63) (< 0 ~M~0) (not (< .cse64 c_~min3~0)) (not (< .cse63 .cse64)))))) (< (select .cse68 .cse8) c_~min1~0) (< (select .cse68 .cse7) c_~min1~0))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse71 (select .cse72 c_~A~0.base)) (.cse69 (select (store .cse72 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse70 (* ~M~0 4))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse69 (+ c_~A~0.offset .cse70)) c_~min3~0) (< 0 ~M~0) (< (select .cse71 .cse8) c_~min1~0) (< (select .cse71 .cse7) c_~min1~0) (< (select .cse69 (+ c_~A~0.offset .cse70 4)) c_~min3~0))))) (= c_~min1~0 c_~min3~0) .cse26) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse73 (select .cse78 c_~A~0.base))) (let ((.cse74 (select .cse73 .cse8))) (or (< (select .cse73 .cse7) .cse74) (not (< .cse74 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse76 (select (store .cse78 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse77 (* ~M~0 4))) (let ((.cse75 (select .cse76 (+ c_~A~0.offset .cse77 4)))) (or (not (< .cse75 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse76 (+ c_~A~0.offset .cse77)) c_~min3~0) (not (< .cse75 c_~min3~0)) (< 0 ~M~0) (= .cse74 .cse75)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse82 (select .cse83 c_~A~0.base))) (let ((.cse79 (select .cse82 .cse7)) (.cse80 (select (store .cse83 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse81 (* ~M~0 4))) (or (= .cse79 c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< (select .cse80 (+ c_~A~0.offset .cse81)) c_~min3~0) (< 0 ~M~0) (not (< .cse79 c_~min1~0)) (< (select .cse82 .cse8) c_~min1~0) (< (select .cse80 (+ c_~A~0.offset .cse81 4)) c_~min3~0)))))) .cse26) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse84 (select .cse90 c_~A~0.base))) (let ((.cse85 (select .cse84 .cse8))) (or (< (select .cse84 .cse7) .cse85) (not (< .cse85 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse88 (select (store .cse90 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse89 (* ~M~0 4))) (let ((.cse86 (select .cse88 (+ c_~A~0.offset .cse89 4))) (.cse87 (select .cse88 (+ c_~A~0.offset .cse89)))) (or (not (< .cse86 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse85 .cse86) (not (< .cse87 c_~min3~0)) (not (< .cse86 .cse87))))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse98 (select .cse97 c_~A~0.base))) (let ((.cse91 (select .cse98 .cse8)) (.cse92 (select .cse98 .cse7))) (or (not (< .cse91 c_~min1~0)) (not (< .cse92 .cse91)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse95 (select (store .cse97 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse96 (* ~M~0 4))) (let ((.cse93 (select .cse95 (+ c_~A~0.offset .cse96 4))) (.cse94 (select .cse95 (+ c_~A~0.offset .cse96)))) (or (not (< .cse93 c_~min2~0)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse92 .cse93) (not (< .cse94 c_~min3~0)) (not (< .cse93 .cse94)))))))))))))) is different from false [2022-11-04 12:18:55,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (not (< c_~min3~0 c_~min2~0))) (.cse6 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse5 (select .cse4 c_~A~0.base))) (let ((.cse3 (select .cse5 c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse2 (* ~M~0 4))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset .cse2 4)))) (or (not (< .cse0 c_~min2~0)) (< (select .cse1 (+ c_~A~0.offset .cse2)) c_~min3~0) (not (< .cse0 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse0 .cse3))))) (< (select .cse5 .cse6) .cse3) (not (< .cse3 c_~min1~0))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse10 (select .cse11 c_~A~0.base))) (let ((.cse7 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse8 (* ~M~0 4)) (.cse9 (select .cse10 c_~A~0.offset))) (or (< (select .cse7 (+ c_~A~0.offset .cse8)) c_~min3~0) (< 0 ~M~0) (= c_~min3~0 .cse9) (< ~M~0 0) (< (select .cse10 .cse6) .cse9) (< (select .cse7 (+ c_~A~0.offset .cse8 4)) c_~min3~0) (not (< .cse9 c_~min1~0))))))) .cse12) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse13 (select .cse17 c_~A~0.base))) (or (< (select .cse13 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse15 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse16 (* ~M~0 4))) (let ((.cse14 (select .cse15 (+ c_~A~0.offset .cse16)))) (or (not (< .cse14 c_~min2~0)) (< 0 ~M~0) (= c_~min1~0 .cse14) (< ~M~0 0) (< (select .cse15 (+ c_~A~0.offset .cse16 4)) .cse14) (not (< .cse14 c_~min3~0)))))) (< (select .cse13 .cse6) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse18 (select .cse23 c_~A~0.base))) (or (< (select .cse18 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse22 (* ~M~0 4))) (let ((.cse19 (select .cse21 (+ c_~A~0.offset .cse22 4))) (.cse20 (select .cse21 (+ c_~A~0.offset .cse22)))) (or (not (< .cse19 c_~min2~0)) (= c_~min1~0 .cse19) (< 0 ~M~0) (< ~M~0 0) (not (< .cse20 c_~min3~0)) (not (< .cse19 .cse20)))))) (< (select .cse18 .cse6) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse31 (select .cse30 c_~A~0.base))) (let ((.cse24 (select .cse31 .cse6)) (.cse25 (select .cse31 c_~A~0.offset))) (or (not (< .cse24 .cse25)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse28 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse29 (* ~M~0 4))) (let ((.cse26 (select .cse28 (+ c_~A~0.offset .cse29 4))) (.cse27 (select .cse28 (+ c_~A~0.offset .cse29)))) (or (not (< .cse26 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse27 c_~min3~0)) (= .cse24 .cse26) (not (< .cse26 .cse27)))))) (not (< .cse25 c_~min1~0))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse32 (select .cse36 c_~A~0.base))) (let ((.cse33 (select .cse32 .cse6)) (.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse35 (* ~M~0 4))) (or (< (select .cse32 c_~A~0.offset) c_~min1~0) (= .cse33 c_~min3~0) (< (select .cse34 (+ c_~A~0.offset .cse35)) c_~min3~0) (< 0 ~M~0) (not (< .cse33 c_~min1~0)) (< ~M~0 0) (< (select .cse34 (+ c_~A~0.offset .cse35 4)) c_~min3~0)))))) .cse12) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse43 (select .cse42 c_~A~0.base))) (let ((.cse38 (select .cse43 c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse40 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse41 (* ~M~0 4))) (let ((.cse37 (select .cse40 (+ c_~A~0.offset .cse41 4))) (.cse39 (select .cse40 (+ c_~A~0.offset .cse41)))) (or (not (< .cse37 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse37 .cse38) (not (< .cse39 c_~min3~0)) (not (< .cse37 .cse39)))))) (< (select .cse43 .cse6) .cse38) (not (< .cse38 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse49 (select .cse48 c_~A~0.base))) (let ((.cse45 (select .cse49 c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse46 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse47 (* ~M~0 4))) (let ((.cse44 (select .cse46 (+ c_~A~0.offset .cse47)))) (or (not (< .cse44 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse45 .cse44) (< (select .cse46 (+ c_~A~0.offset .cse47 4)) .cse44) (not (< .cse44 c_~min3~0)))))) (< (select .cse49 .cse6) .cse45) (not (< .cse45 c_~min1~0))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse50 (select .cse53 c_~A~0.base)) (.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse52 (* ~M~0 4))) (or (< (select .cse50 c_~A~0.offset) c_~min1~0) (< (select .cse51 (+ c_~A~0.offset .cse52)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse50 .cse6) c_~min1~0) (< (select .cse51 (+ c_~A~0.offset .cse52 4)) c_~min3~0))))) (= c_~min1~0 c_~min3~0) .cse12) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse58 (select .cse59 c_~A~0.base))) (let ((.cse54 (select .cse58 .cse6)) (.cse56 (select (store .cse59 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse57 (* ~M~0 4)) (.cse55 (select .cse58 c_~A~0.offset))) (or (= .cse54 c_~min3~0) (not (< .cse54 .cse55)) (< (select .cse56 (+ c_~A~0.offset .cse57)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse56 (+ c_~A~0.offset .cse57 4)) c_~min3~0) (not (< .cse55 c_~min1~0))))))) .cse12) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse60 (select .cse64 c_~A~0.base))) (or (< (select .cse60 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse62 (select (store .cse64 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse63 (* ~M~0 4))) (let ((.cse61 (select .cse62 (+ c_~A~0.offset .cse63 4)))) (or (not (< .cse61 c_~min2~0)) (< (select .cse62 (+ c_~A~0.offset .cse63)) c_~min3~0) (= c_~min1~0 .cse61) (not (< .cse61 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0))))) (< (select .cse60 .cse6) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse65 (select .cse71 c_~A~0.base))) (let ((.cse66 (select .cse65 .cse6))) (or (< (select .cse65 c_~A~0.offset) c_~min1~0) (not (< .cse66 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse69 (select (store .cse71 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse70 (* ~M~0 4))) (let ((.cse67 (select .cse69 (+ c_~A~0.offset .cse70 4))) (.cse68 (select .cse69 (+ c_~A~0.offset .cse70)))) (or (not (< .cse67 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse68 c_~min3~0)) (= .cse66 .cse67) (not (< .cse67 .cse68))))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse78 (select .cse77 c_~A~0.base))) (let ((.cse72 (select .cse78 .cse6)) (.cse73 (select .cse78 c_~A~0.offset))) (or (not (< .cse72 .cse73)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse75 (select (store .cse77 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse76 (* ~M~0 4))) (let ((.cse74 (select .cse75 (+ c_~A~0.offset .cse76 4)))) (or (not (< .cse74 c_~min2~0)) (< (select .cse75 (+ c_~A~0.offset .cse76)) c_~min3~0) (not (< .cse74 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse72 .cse74))))) (not (< .cse73 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse79 (select .cse84 c_~A~0.base))) (let ((.cse83 (select .cse79 .cse6))) (or (< (select .cse79 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse81 (select (store .cse84 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse82 (* ~M~0 4))) (let ((.cse80 (select .cse81 (+ c_~A~0.offset .cse82 4)))) (or (not (< .cse80 c_~min2~0)) (< (select .cse81 (+ c_~A~0.offset .cse82)) c_~min3~0) (not (< .cse80 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse83 .cse80))))) (not (< .cse83 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse85 (select .cse90 c_~A~0.base))) (let ((.cse86 (select .cse85 .cse6))) (or (< (select .cse85 c_~A~0.offset) c_~min1~0) (not (< .cse86 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse88 (select (store .cse90 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse89 (* ~M~0 4))) (let ((.cse87 (select .cse88 (+ c_~A~0.offset .cse89)))) (or (not (< .cse87 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse88 (+ c_~A~0.offset .cse89 4)) .cse87) (not (< .cse87 c_~min3~0)) (= .cse86 .cse87)))))))))) (forall ((v_ArrVal_685 (Array Int Int))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse97 (select .cse96 c_~A~0.base))) (let ((.cse91 (select .cse97 .cse6)) (.cse92 (select .cse97 c_~A~0.offset))) (or (not (< .cse91 .cse92)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse94 (select (store .cse96 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse95 (* ~M~0 4))) (let ((.cse93 (select .cse94 (+ c_~A~0.offset .cse95)))) (or (not (< .cse93 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse94 (+ c_~A~0.offset .cse95 4)) .cse93) (not (< .cse93 c_~min3~0)) (= .cse91 .cse93))))) (not (< .cse92 c_~min1~0))))))))) is different from false [2022-11-04 12:18:56,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (not (< c_~min3~0 c_~min2~0))) (.cse7 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse1 (select .cse6 c_~A~0.base))) (let ((.cse0 (select .cse1 .cse7))) (or (not (< .cse0 c_~min1~0)) (< (select .cse1 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse5 (* ~M~0 4))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset .cse5))) (.cse2 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (or (not (< .cse2 .cse3)) (not (< .cse3 c_~min3~0)) (not (< .cse2 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse2 .cse0)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse8 (select .cse12 c_~A~0.base))) (or (< (select .cse8 .cse7) c_~min1~0) (< (select .cse8 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse10 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ c_~A~0.offset .cse11)))) (or (not (< .cse9 c_~min3~0)) (< 0 ~M~0) (< (select .cse10 (+ c_~A~0.offset .cse11 4)) .cse9) (not (< .cse9 c_~min2~0)) (< ~M~0 0) (= c_~min1~0 .cse9))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse14 (select .cse19 c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (not (< .cse13 c_~min1~0)) (< (select .cse14 .cse7) .cse13) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset .cse18))) (.cse15 (select .cse17 (+ c_~A~0.offset .cse18 4)))) (or (not (< .cse15 .cse16)) (not (< .cse16 c_~min3~0)) (not (< .cse15 c_~min2~0)) (< 0 ~M~0) (= .cse15 .cse13) (< ~M~0 0)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse26 (select .cse25 c_~A~0.base))) (let ((.cse20 (select .cse26 c_~A~0.offset)) (.cse21 (select .cse26 .cse7))) (or (not (< .cse20 c_~min1~0)) (not (< .cse21 .cse20)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse23 (* ~M~0 4))) (let ((.cse24 (select .cse22 (+ c_~A~0.offset .cse23 4)))) (or (< (select .cse22 (+ c_~A~0.offset .cse23)) c_~min3~0) (not (< .cse24 c_~min2~0)) (not (< .cse24 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse24 .cse21)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse27 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse28 (* ~M~0 4)) (.cse29 (select .cse30 c_~A~0.base))) (or (< (select .cse27 (+ c_~A~0.offset .cse28)) c_~min3~0) (< (select .cse29 .cse7) c_~min1~0) (< (select .cse27 (+ c_~A~0.offset .cse28 4)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse29 c_~A~0.offset) c_~min1~0))))) (= c_~min1~0 c_~min3~0) .cse31) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse37 (select .cse36 c_~A~0.base))) (let ((.cse32 (select .cse37 c_~A~0.offset))) (or (not (< .cse32 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse34 (* ~M~0 4))) (let ((.cse35 (select .cse33 (+ c_~A~0.offset .cse34 4)))) (or (< (select .cse33 (+ c_~A~0.offset .cse34)) c_~min3~0) (not (< .cse35 c_~min2~0)) (not (< .cse35 c_~min3~0)) (< 0 ~M~0) (= .cse35 .cse32) (< ~M~0 0))))) (< (select .cse37 .cse7) .cse32)))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse42 (select .cse41 c_~A~0.base))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse39 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse40 (* ~M~0 4))) (let ((.cse38 (select .cse39 (+ c_~A~0.offset .cse40 4)))) (or (= c_~min1~0 .cse38) (< (select .cse39 (+ c_~A~0.offset .cse40)) c_~min3~0) (not (< .cse38 c_~min2~0)) (not (< .cse38 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0))))) (< (select .cse42 .cse7) c_~min1~0) (< (select .cse42 c_~A~0.offset) c_~min1~0))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse47 (select .cse48 c_~A~0.base))) (let ((.cse43 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse44 (* ~M~0 4)) (.cse45 (select .cse47 c_~A~0.offset)) (.cse46 (select .cse47 .cse7))) (or (< (select .cse43 (+ c_~A~0.offset .cse44)) c_~min3~0) (< (select .cse43 (+ c_~A~0.offset .cse44 4)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse45 c_~min1~0)) (not (< .cse46 .cse45)) (= c_~min3~0 .cse46)))))) .cse31) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse54 (select .cse53 c_~A~0.base))) (let ((.cse49 (select .cse54 c_~A~0.offset))) (or (not (< .cse49 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse52 (* ~M~0 4))) (let ((.cse50 (select .cse51 (+ c_~A~0.offset .cse52)))) (or (not (< .cse50 c_~min3~0)) (< 0 ~M~0) (< (select .cse51 (+ c_~A~0.offset .cse52 4)) .cse50) (not (< .cse50 c_~min2~0)) (= .cse50 .cse49) (< ~M~0 0))))) (< (select .cse54 .cse7) .cse49)))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse56 (select .cse60 c_~A~0.base))) (let ((.cse55 (select .cse56 .cse7))) (or (not (< .cse55 c_~min1~0)) (< (select .cse56 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse58 (select (store .cse60 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse59 (* ~M~0 4))) (let ((.cse57 (select .cse58 (+ c_~A~0.offset .cse59)))) (or (= .cse57 .cse55) (not (< .cse57 c_~min3~0)) (< 0 ~M~0) (< (select .cse58 (+ c_~A~0.offset .cse59 4)) .cse57) (not (< .cse57 c_~min2~0)) (< ~M~0 0)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse61 (select .cse66 c_~A~0.base))) (or (< (select .cse61 .cse7) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse64 (select (store .cse66 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse65 (* ~M~0 4))) (let ((.cse63 (select .cse64 (+ c_~A~0.offset .cse65))) (.cse62 (select .cse64 (+ c_~A~0.offset .cse65 4)))) (or (= c_~min1~0 .cse62) (not (< .cse62 .cse63)) (not (< .cse63 c_~min3~0)) (not (< .cse62 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0))))) (< (select .cse61 c_~A~0.offset) c_~min1~0))))) (or .cse31 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse70 (select .cse71 c_~A~0.base))) (let ((.cse67 (select (store .cse71 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse68 (* ~M~0 4)) (.cse69 (select .cse70 c_~A~0.offset))) (or (< (select .cse67 (+ c_~A~0.offset .cse68)) c_~min3~0) (< (select .cse67 (+ c_~A~0.offset .cse68 4)) c_~min3~0) (< 0 ~M~0) (= .cse69 c_~min3~0) (< ~M~0 0) (not (< .cse69 c_~min1~0)) (< (select .cse70 .cse7) .cse69))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse77 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse78 (select .cse77 c_~A~0.base))) (let ((.cse74 (select .cse78 .cse7)) (.cse72 (select .cse78 c_~A~0.offset))) (or (not (< .cse72 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse75 (select (store .cse77 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse76 (* ~M~0 4))) (let ((.cse73 (select .cse75 (+ c_~A~0.offset .cse76)))) (or (= .cse73 .cse74) (not (< .cse73 c_~min3~0)) (< 0 ~M~0) (< (select .cse75 (+ c_~A~0.offset .cse76 4)) .cse73) (not (< .cse73 c_~min2~0)) (< ~M~0 0))))) (not (< .cse74 .cse72))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse85 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse86 (select .cse85 c_~A~0.base))) (let ((.cse82 (select .cse86 .cse7)) (.cse79 (select .cse86 c_~A~0.offset))) (or (not (< .cse79 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse83 (select (store .cse85 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse84 (* ~M~0 4))) (let ((.cse81 (select .cse83 (+ c_~A~0.offset .cse84))) (.cse80 (select .cse83 (+ c_~A~0.offset .cse84 4)))) (or (not (< .cse80 .cse81)) (not (< .cse81 c_~min3~0)) (not (< .cse80 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse80 .cse82))))) (not (< .cse82 .cse79))))))) (or .cse31 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse91 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse90 (select .cse91 c_~A~0.base))) (let ((.cse87 (select (store .cse91 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse88 (* ~M~0 4)) (.cse89 (select .cse90 .cse7))) (or (< (select .cse87 (+ c_~A~0.offset .cse88)) c_~min3~0) (not (< .cse89 c_~min1~0)) (< (select .cse87 (+ c_~A~0.offset .cse88 4)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse90 c_~A~0.offset) c_~min1~0) (= c_~min3~0 .cse89))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse93 (select .cse97 c_~A~0.base))) (let ((.cse92 (select .cse93 .cse7))) (or (not (< .cse92 c_~min1~0)) (< (select .cse93 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse94 (select (store .cse97 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base)) (.cse95 (* ~M~0 4))) (let ((.cse96 (select .cse94 (+ c_~A~0.offset .cse95 4)))) (or (< (select .cse94 (+ c_~A~0.offset .cse95)) c_~min3~0) (not (< .cse96 c_~min2~0)) (not (< .cse96 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse96 .cse92)))))))))))) is different from false [2022-11-04 12:19:02,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~min3~0 c_~min2~0))) (.cse5 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse2 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse3 (* ~M~0 4))) (or (< 0 ~M~0) (not (< .cse1 c_~min1~0)) (< ~M~0 0) (< (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3 4)) c_~min3~0) (= .cse1 c_~min3~0) (< (select .cse4 .cse5) .cse1) (< (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse3)) c_~min3~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse7 (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse8 (select .cse7 .cse5))) (or (< (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (not (< .cse8 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse12 (* ~M~0 4))) (let ((.cse10 (select .cse11 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse12 4))) (.cse9 (select .cse11 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse12)))) (or (not (< .cse9 c_~min3~0)) (< 0 ~M~0) (= .cse8 .cse10) (< ~M~0 0) (not (< .cse10 c_~min2~0)) (not (< .cse10 .cse9))))))))))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse14 (select .cse19 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse17 (select .cse19 .cse5)) (.cse15 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse16 (* ~M~0 4))) (or (< 0 ~M~0) (not (< .cse14 c_~min1~0)) (< ~M~0 0) (< (select .cse15 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16 4)) c_~min3~0) (not (< .cse17 .cse14)) (= .cse17 c_~min3~0) (< (select .cse15 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16)) c_~min3~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse20 (select .cse24 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse20 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse20 .cse5) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse23 (* ~M~0 4))) (let ((.cse21 (select .cse22 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse23 4)))) (or (not (< .cse21 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse21 c_~min2~0)) (< (select .cse22 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse23)) c_~min3~0) (= c_~min1~0 .cse21))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse26 (select .cse30 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse28 (* ~M~0 4))) (let ((.cse25 (select .cse27 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28 4)))) (or (not (< .cse25 c_~min3~0)) (< 0 ~M~0) (= .cse26 .cse25) (< ~M~0 0) (not (< .cse25 c_~min2~0)) (< (select .cse27 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28)) c_~min3~0))))) (not (< .cse26 c_~min1~0)) (< (select .cse30 .cse5) .cse26)))))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse34 (select .cse31 .cse5)) (.cse32 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse33 (* ~M~0 4))) (or (< (select .cse31 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33 4)) c_~min3~0) (= .cse34 c_~min3~0) (not (< .cse34 c_~min1~0)) (< (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33)) c_~min3~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse36 (select .cse43 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse37 (select .cse43 .cse5))) (or (not (< .cse36 c_~min1~0)) (not (< .cse37 .cse36)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse40 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse41 (* ~M~0 4))) (let ((.cse39 (select .cse40 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse41 4))) (.cse38 (select .cse40 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse41)))) (or (not (< .cse38 c_~min3~0)) (< 0 ~M~0) (= .cse37 .cse39) (< ~M~0 0) (not (< .cse39 c_~min2~0)) (not (< .cse39 .cse38))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse45 (select .cse50 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse44 c_~min1~0)) (< (select .cse45 .cse5) .cse44) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse48 (select (store .cse50 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse49 (* ~M~0 4))) (let ((.cse47 (select .cse48 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse49 4))) (.cse46 (select .cse48 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse49)))) (or (not (< .cse46 c_~min3~0)) (< 0 ~M~0) (= .cse44 .cse47) (< ~M~0 0) (not (< .cse47 c_~min2~0)) (not (< .cse47 .cse46))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse53 (select (store .cse55 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse54 (* ~M~0 4))) (let ((.cse51 (select .cse53 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse54))) (.cse52 (select .cse53 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse54 4)))) (or (not (< .cse51 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse52 c_~min2~0)) (not (< .cse52 .cse51)) (= c_~min1~0 .cse52))))) (< (select .cse56 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse56 .cse5) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse57 (select .cse63 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse58 (select .cse63 .cse5))) (or (not (< .cse57 c_~min1~0)) (not (< .cse58 .cse57)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse59 (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse60 (* ~M~0 4))) (let ((.cse61 (select .cse59 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse60)))) (or (< (select .cse59 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse60 4)) .cse61) (not (< .cse61 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse58 .cse61) (not (< .cse61 c_~min2~0))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse68 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse64 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse64 .cse5) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse65 (select (store .cse68 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse66 (* ~M~0 4))) (let ((.cse67 (select .cse65 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse66)))) (or (< (select .cse65 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse66 4)) .cse67) (not (< .cse67 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse67) (not (< .cse67 c_~min2~0)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse74 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse69 (select .cse74 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse73 (select .cse69 .cse5))) (or (< (select .cse69 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse70 (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse71 (* ~M~0 4))) (let ((.cse72 (select .cse70 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse71)))) (or (< (select .cse70 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse71 4)) .cse72) (not (< .cse72 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse73 .cse72) (not (< .cse72 c_~min2~0)))))) (not (< .cse73 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse80 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse75 (select .cse81 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse76 (select .cse81 .cse5))) (or (not (< .cse75 c_~min1~0)) (not (< .cse76 .cse75)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse78 (select (store .cse80 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse79 (* ~M~0 4))) (let ((.cse77 (select .cse78 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse79 4)))) (or (not (< .cse77 c_~min3~0)) (< 0 ~M~0) (= .cse76 .cse77) (< ~M~0 0) (not (< .cse77 c_~min2~0)) (< (select .cse78 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse79)) c_~min3~0)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse87 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse83 (select .cse87 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse82 (select .cse83 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse82 c_~min1~0)) (< (select .cse83 .cse5) .cse82) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse84 (select (store .cse87 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse85 (* ~M~0 4))) (let ((.cse86 (select .cse84 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse85)))) (or (< (select .cse84 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse85 4)) .cse86) (not (< .cse86 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse86 c_~min2~0)) (= .cse82 .cse86)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse93 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse88 (select .cse93 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse89 (select .cse88 .cse5))) (or (< (select .cse88 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (not (< .cse89 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse91 (select (store .cse93 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse92 (* ~M~0 4))) (let ((.cse90 (select .cse91 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse92 4)))) (or (not (< .cse90 c_~min3~0)) (< 0 ~M~0) (= .cse89 .cse90) (< ~M~0 0) (not (< .cse90 c_~min2~0)) (< (select .cse91 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse92)) c_~min3~0)))))))))) (or (= c_~min1~0 c_~min3~0) .cse0 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse94 (select .cse97 |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse95 (select (store .cse97 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse96 (* ~M~0 4))) (or (< (select .cse94 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< 0 ~M~0) (< (select .cse94 .cse5) c_~min1~0) (< ~M~0 0) (< (select .cse95 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse96 4)) c_~min3~0) (< (select .cse95 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse96)) c_~min3~0)))))))) is different from false [2022-11-04 12:19:03,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse26 (not (< c_~min3~0 c_~min2~0))) (.cse6 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse5 .cse6))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse2 (* ~M~0 4))) (let ((.cse3 (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (< (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse3 c_~min3~0)) (not (< .cse3 c_~min2~0)) (= .cse0 .cse3))))) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse8 (select .cse13 .cse6))) (or (not (< .cse7 c_~min1~0)) (not (< .cse8 .cse7)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse10 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse11 (* ~M~0 4))) (let ((.cse9 (select .cse10 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse9 .cse8) (not (< .cse9 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse10 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse9) (not (< .cse9 c_~min3~0))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse14 (select .cse20 .cse6))) (or (not (< .cse14 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse15 (select .cse17 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse15 .cse16)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse16 c_~min3~0)) (not (< .cse15 c_~min2~0)) (= .cse14 .cse15))))) (< (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse21 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse22 (* ~M~0 4)) (.cse23 (select .cse24 .cse6))) (or (< (select .cse21 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse21 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse23 c_~min1~0)) (= c_~min3~0 .cse23) (< (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))))) .cse26) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse27 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse28 (select .cse34 .cse6))) (or (not (< .cse27 c_~min1~0)) (not (< .cse28 .cse27)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse31 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse32 (* ~M~0 4))) (let ((.cse30 (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse29 (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse29 .cse30)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse30 c_~min3~0)) (not (< .cse29 c_~min2~0)) (= .cse28 .cse29)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse35 .cse6) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse38 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse39 (* ~M~0 4))) (let ((.cse37 (select .cse38 (+ .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse36 (select .cse38 (+ .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse36 .cse37)) (= c_~min1~0 .cse36) (< 0 ~M~0) (< ~M~0 0) (not (< .cse37 c_~min3~0)) (not (< .cse36 c_~min2~0)))))) (< (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse41 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse42 (select .cse47 .cse6))) (or (not (< .cse41 c_~min1~0)) (not (< .cse42 .cse41)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse43 (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse44 (* ~M~0 4))) (let ((.cse45 (select .cse43 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (< (select .cse43 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse45 c_~min3~0)) (not (< .cse45 c_~min2~0)) (= .cse42 .cse45)))))))))) (or (= c_~min1~0 c_~min3~0) (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse48 (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse49 (* ~M~0 4)) (.cse50 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse48 (+ .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse48 (+ .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (< 0 ~M~0) (< (select .cse50 .cse6) c_~min1~0) (< ~M~0 0) (< (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) .cse26) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse53 (select .cse57 .cse6))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse54 (select (store .cse56 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse55 (* ~M~0 4))) (let ((.cse52 (select .cse54 (+ .cse55 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse52 .cse53) (not (< .cse52 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse54 (+ .cse55 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse52) (not (< .cse52 c_~min3~0)))))) (not (< .cse53 c_~min1~0)) (< (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))))) (or .cse26 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse63 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse58 (select (store .cse63 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse59 (* ~M~0 4)) (.cse60 (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse61 (select .cse62 .cse6))) (or (< (select .cse58 (+ .cse59 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse58 (+ .cse59 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (not (< .cse60 c_~min1~0)) (not (< .cse61 .cse60)) (< 0 ~M~0) (< ~M~0 0) (= c_~min3~0 .cse61))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse65 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse64 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse64 c_~min1~0)) (< (select .cse65 .cse6) .cse64) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse67 (select (store .cse69 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse68 (* ~M~0 4))) (let ((.cse66 (select .cse67 (+ .cse68 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse66 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse64 .cse66) (< (select .cse67 (+ .cse68 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse66) (not (< .cse66 c_~min3~0))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse75 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse70 (select .cse76 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse70 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse73 (select (store .cse75 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse74 (* ~M~0 4))) (let ((.cse72 (select .cse73 (+ .cse74 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse71 (select .cse73 (+ .cse74 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (not (< .cse71 .cse72)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse72 c_~min3~0)) (not (< .cse71 c_~min2~0)) (= .cse70 .cse71))))) (< (select .cse76 .cse6) .cse70)))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse81 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse77 (select .cse81 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse77 .cse6) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse78 (select (store .cse81 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse79 (* ~M~0 4))) (let ((.cse80 (select .cse78 (+ .cse79 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (< (select .cse78 (+ .cse79 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (= c_~min1~0 .cse80) (< 0 ~M~0) (< ~M~0 0) (not (< .cse80 c_~min3~0)) (not (< .cse80 c_~min2~0)))))) (< (select .cse77 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (or .cse26 (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse86 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse85 (select .cse86 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse82 (select (store .cse86 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse83 (* ~M~0 4)) (.cse84 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse82 (+ .cse83 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse82 (+ .cse83 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min3~0) (not (< .cse84 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse84 c_~min3~0) (< (select .cse85 .cse6) .cse84))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse92 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse88 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse87 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse87 c_~min1~0)) (< (select .cse88 .cse6) .cse87) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse89 (select (store .cse92 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse90 (* ~M~0 4))) (let ((.cse91 (select .cse89 (+ .cse90 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (or (< (select .cse89 (+ .cse90 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse91 c_~min3~0)) (not (< .cse91 c_~min2~0)) (= .cse87 .cse91)))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse93 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse93 .cse6) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse95 (select (store .cse97 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse96 (* ~M~0 4))) (let ((.cse94 (select .cse95 (+ .cse96 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse94 c_~min2~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse94) (< (select .cse95 (+ .cse96 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse94) (not (< .cse94 c_~min3~0)))))) (< (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))))) is different from false [2022-11-04 12:19:04,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (not (< c_~min3~0 c_~min2~0))) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (select .cse5 .cse6)) (.cse2 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (* ~M~0 4))) (or (not (< .cse0 .cse1)) (< 0 ~M~0) (< (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< .cse1 c_~min1~0)) (= c_~min3~0 .cse0) (< (select .cse2 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))))) .cse7) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse6))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse9 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse10 (* ~M~0 4))) (let ((.cse8 (select .cse9 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse8 c_~min3~0)) (< 0 ~M~0) (< (select .cse9 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (< ~M~0 0) (not (< .cse8 c_~min2~0)) (= .cse8 .cse11))))) (not (< .cse11 c_~min1~0)) (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse15 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* ~M~0 4))) (or (< 0 ~M~0) (< (select .cse14 .cse6) c_~min1~0) (< (select .cse15 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (< (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (select .cse15 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (= c_~min1~0 c_~min3~0) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse21 .cse6)) (.cse18 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse19 (* ~M~0 4))) (or (< 0 ~M~0) (< (select .cse18 (+ .cse19 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< .cse20 c_~min1~0)) (< (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (= c_~min3~0 .cse20) (< (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))))) .cse7) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse23 (select .cse30 .cse6))) (or (not (< .cse23 .cse24)) (not (< .cse24 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse28 (* ~M~0 4))) (let ((.cse25 (select .cse27 (+ .cse28 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse26 (select .cse27 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse25 .cse23) (not (< .cse26 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse25 c_~min2~0)) (not (< .cse25 .cse26))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse31 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse31 .cse6) .cse32) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse35 (* ~M~0 4))) (let ((.cse33 (select .cse34 (+ .cse35 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (not (< .cse33 c_~min3~0)) (< ~M~0 0) (not (< .cse33 c_~min2~0)) (= .cse33 .cse32) (< (select .cse34 (+ .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse32 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse38 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse38 .cse6))) (or (not (< .cse37 c_~min1~0)) (< (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse41 (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse42 (* ~M~0 4))) (let ((.cse39 (select .cse41 (+ .cse42 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse40 (select .cse41 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse39 .cse37) (not (< .cse40 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse39 c_~min2~0)) (not (< .cse39 .cse40))))))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse45 (select (store .cse47 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse46 (* ~M~0 4))) (let ((.cse44 (select .cse45 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse44) (not (< .cse44 c_~min3~0)) (< 0 ~M~0) (< (select .cse45 (+ .cse46 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse44) (< ~M~0 0) (not (< .cse44 c_~min2~0)))))) (< (select .cse48 .cse6) c_~min1~0) (< (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse49 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse49 .cse6) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse51 (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse52 (* ~M~0 4))) (let ((.cse50 (select .cse51 (+ .cse52 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse50) (< 0 ~M~0) (not (< .cse50 c_~min3~0)) (< ~M~0 0) (not (< .cse50 c_~min2~0)) (< (select .cse51 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (< (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse59 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse54 (select .cse60 .cse6)) (.cse55 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse54 .cse55)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse57 (select (store .cse59 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse58 (* ~M~0 4))) (let ((.cse56 (select .cse57 (+ .cse58 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse56 c_~min3~0)) (< 0 ~M~0) (< (select .cse57 (+ .cse58 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse56) (< ~M~0 0) (not (< .cse56 c_~min2~0)) (= .cse56 .cse54))))) (not (< .cse55 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse64 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse62 (select (store .cse65 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse63 (* ~M~0 4))) (let ((.cse61 (select .cse62 (+ .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse61 c_~min3~0)) (< 0 ~M~0) (< (select .cse62 (+ .cse63 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse61) (< ~M~0 0) (= .cse61 .cse64) (not (< .cse61 c_~min2~0)))))) (< (select .cse66 .cse6) .cse64) (not (< .cse64 c_~min1~0))))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse72 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse67 (select .cse73 .cse6)) (.cse68 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse67 .cse68)) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse70 (select (store .cse72 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse71 (* ~M~0 4))) (let ((.cse69 (select .cse70 (+ .cse71 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse69 .cse67) (< 0 ~M~0) (not (< .cse69 c_~min3~0)) (< ~M~0 0) (not (< .cse69 c_~min2~0)) (< (select .cse70 (+ .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse68 c_~min1~0))))))) (or (forall ((~M~0 Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse78 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse74 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse76 (select (store .cse78 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse77 (* ~M~0 4))) (or (< (select .cse74 .cse6) .cse75) (< 0 ~M~0) (< (select .cse76 (+ .cse77 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< .cse75 c_~min1~0)) (= c_~min3~0 .cse75) (< (select .cse76 (+ .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))))) .cse7) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse84 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse79 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse79 .cse6) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse82 (select (store .cse84 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse83 (* ~M~0 4))) (let ((.cse80 (select .cse82 (+ .cse83 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse81 (select .cse82 (+ .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min1~0 .cse80) (not (< .cse81 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse80 c_~min2~0)) (not (< .cse80 .cse81)))))) (< (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse89 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse86 (select .cse90 .cse6))) (or (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse87 (select (store .cse89 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse88 (* ~M~0 4))) (let ((.cse85 (select .cse87 (+ .cse88 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse85 .cse86) (< 0 ~M~0) (not (< .cse85 c_~min3~0)) (< ~M~0 0) (not (< .cse85 c_~min2~0)) (< (select .cse87 (+ .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) (not (< .cse86 c_~min1~0)) (< (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))) (forall ((v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_685))) (let ((.cse91 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse92 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse91 .cse6) .cse92) (forall ((~M~0 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse95 (select (store .cse97 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse96 (* ~M~0 4))) (let ((.cse94 (select .cse95 (+ .cse96 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse93 (select .cse95 (+ .cse96 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse93 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse94 c_~min2~0)) (= .cse94 .cse92) (not (< .cse94 .cse93)))))) (not (< .cse92 c_~min1~0))))))))) is different from false [2022-11-04 12:19:06,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:19:06,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 157 [2022-11-04 12:19:06,954 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:06,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5451 treesize of output 4977 [2022-11-04 12:19:07,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4832 treesize of output 3968 [2022-11-04 12:19:07,128 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:07,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4073 treesize of output 3381 [2022-11-04 12:19:07,244 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:07,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3208 treesize of output 2866 [2022-11-04 12:19:10,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:19:10,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 106 [2022-11-04 12:19:10,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:10,968 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:10,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 288 [2022-11-04 12:19:10,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:10,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:10,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:10,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 152 [2022-11-04 12:19:11,009 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 219 [2022-11-04 12:19:11,176 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-11-04 12:19:11,185 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 1 [2022-11-04 12:19:11,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:19:11,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 144 [2022-11-04 12:19:11,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:11,226 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 432 treesize of output 387 [2022-11-04 12:19:11,265 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 309 [2022-11-04 12:19:11,303 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 207 [2022-11-04 12:19:11,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:19:11,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2022-11-04 12:19:11,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:11,766 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 230 [2022-11-04 12:19:11,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:11,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:11,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:11,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 100 [2022-11-04 12:19:11,811 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:11,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 203 treesize of output 173 [2022-11-04 12:19:11,907 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 1 [2022-11-04 12:19:11,918 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2022-11-04 12:19:11,930 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2022-11-04 12:19:11,942 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2022-11-04 12:19:11,953 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 1 [2022-11-04 12:19:11,963 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:11,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-04 12:19:11,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:19:11,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 126 [2022-11-04 12:19:11,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:12,008 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:12,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 865 treesize of output 783 [2022-11-04 12:19:12,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:19:12,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:12,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:19:12,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 468 [2022-11-04 12:19:12,072 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-11-04 12:19:12,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 709 treesize of output 585 [2022-11-04 12:19:12,443 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:12,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2022-11-04 12:19:12,454 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:12,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2022-11-04 12:19:12,464 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-04 12:19:12,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 1 [2022-11-04 12:19:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-04 12:19:13,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848320912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:19:13,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:19:13,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 35] total 103 [2022-11-04 12:19:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020150022] [2022-11-04 12:19:13,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:19:13,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-11-04 12:19:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:19:13,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-11-04 12:19:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=8386, Unknown=17, NotChecked=1170, Total=10506 [2022-11-04 12:19:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:19:13,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:19:13,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.8155339805825244) internal successors, (393), 103 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-04 12:19:13,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 287 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 195 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-04 12:19:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.